A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Simeon Ball is a senior lecturer in the Department of Applied Mathematics IV at Universitat Politècnica de Catalunya, Barcelona. He has published over 50 articles and been awarded various prestigious grants, including the Advanced Research Fellowship from EPSRC in the UK and the Ramon y Cajal grant in Spain. In 2012 he proved the MDS conjecture for prime fields, which conjectures that all linear codes over prime fields that meet the Singleton bound are short. This is one of the oldest conjectures in the theory of error-correcting codes.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-21935
Quantità: 2 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar2317530266623
Quantità: Più di 20 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Hardcover. Condizione: Like New. Like New. book. Codice articolo ERICA75811071079975
Quantità: 1 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107107991
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781107107991_new
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 250 pages. 9.06x6.06x0.87 inches. In Stock. This item is printed on demand. Codice articolo __1107107997
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objec. Codice articolo 37111606
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107107991
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 250 pages. 9.06x6.06x0.87 inches. In Stock. Codice articolo x-1107107997
Quantità: 2 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 250 Index. Codice articolo 26316674564
Quantità: 4 disponibili