Finite Geometry and Combinatorial Applications
2015年6月 · London Mathematical Society Student Texts 第 82 本图书 · Cambridge University Press
电子书
299
页
report评分和评价未经验证 了解详情
关于此电子书
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.
作者简介
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.
为此电子书评分
欢迎向我们提供反馈意见。
如何阅读
智能手机和平板电脑
笔记本电脑和台式机
您可以使用计算机的网络浏览器聆听您在 Google Play 购买的有声读物。
电子阅读器和其他设备
如果要在 Kobo 电子阅读器等电子墨水屏设备上阅读，您需要下载一个文件，并将其传输到相应设备上。若要将文件传输到受支持的电子阅读器上，请按帮助中心内的详细说明操作。
