| Finite Geometry and Combinatorial Applications Contributor(s): Ball, Simeon (Author) |
|
 |
ISBN: 1107107997 ISBN-13: 9781107107991 Publisher: Cambridge University Press OUR PRICE: $151.05 Product Type: Hardcover - Other Formats Published: August 2015 |
| Additional Information |
| BISAC Categories: - Mathematics | Discrete Mathematics - Mathematics | Geometry - General - Mathematics | Combinatorics |
| Dewey: 516.11 |
| LCCN: 2015009563 |
| Series: London Mathematical Society Student Texts |
| Physical Information: 1.7" H x 0.6" W x 9.4" (1.25 lbs) 298 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
Contributor Bio(s): Ball, Simeon: - 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. |