Finite Geometry and Combinatorial Applications
£37.99
Part of London Mathematical Society Student Texts
- Author: Simeon Ball, Universitat Politècnica de Catalunya, Barcelona
- Date Published: July 2015
- availability: Available
- format: Paperback
- isbn: 9781107518438
£
37.99
Paperback
Other available formats:
Hardback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- A one-stop introduction to finite geometry and its applications, appealing to a variety of researchers working with combinatorial objects such as codes, graphs and designs
- More than 100 exercises with detailed solutions, making the book suitable for self-study
- A rigorous algebraic approach to finite projective and polar spaces
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: July 2015
- format: Paperback
- isbn: 9781107518438
- length: 295 pages
- dimensions: 228 x 152 x 16 mm
- weight: 0.44kg
- contains: 35 b/w illus. 105 exercises
- availability: Available
Table of Contents
1. Fields
2. Vector spaces
3. Forms
4. Geometries
5. Combinatorial applications
6. The forbidden subgraph problem
7. MDS codes
Appendix A. Solutions to the exercises
Appendix B. Additional proofs
Appendix C. Notes and references
References
Index.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×