Finite Geometry and Combinatorial Applications

Ball, Simeon

ISBN 10: 1107107997 / ISBN 13: 9781107107991

Published by Cambridge University Press, 2015

About this Item

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics. Series: London Mathematical Society Student Texts. Num Pages: 298 pages, 35 b/w illus. 105 exercises. BIC Classification: PBD; PBM; PBV. Category: (U) Tertiary Education (US: College). Dimension: 161 x 237 x 29. Weight in Grams: 598. . 2015. Hardback. . . . . Books ship from the US and Ireland.

Seller Inventory # V9781107107991

Bibliographic Details

• Title: Finite Geometry and Combinatorial Applications
• Publisher: Cambridge University Press
• Publication Date: 2015
• Language: English
• ISBN 10: 1107107997
• ISBN 13: 9781107107991
• Binding: Hardcover
• Condition: New

About this title

Synopsis

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.

About the Author

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.