Combinatorics of Finite Geometries is an undergraduate mathematics textbook on finite geometry by Lynn Batten. It was published by Cambridge University Press in 1986[1][2][3][4] with a second edition in 1997 (ISBN 0-521-59014-0).[5][6]
Topics
editThe types of finite geometry covered by the book include partial linear spaces, linear spaces, affine spaces and affine planes, projective spaces and projective planes, polar spaces, generalized quadrangles, and partial geometries.[1] A central connecting concept is the "connection number" of a point and a line not containing it, equal to the number of lines that meet the given point and intersect the given line.[1][2] The second edition adds a final chapter on blocking sets.[5]
Beyond the basic theorems and proofs of this subject, the book includes many examples[1] and exercises,[3][5] and some history and information about current research.[2]
Audience and reception
editThe book is aimed at advanced undergraduates,[1][2] assuming only an introductory-level of abstract algebra and some knowledge of linear algebra.[1] Its coverage of recent research also makes it useful as background reading for researchers in this area.[5][6]
Reviewer Michael J. Kallaher cites as a "serious shortcoming" of the first edition its lack of coverage of applications of this subject, for instance to the design of experiments and to coding theory.[1] The second edition has a section on applications but reviewer Tamás Szőnyi writes that it needs additional expansion.[6]
Because of the many types of geometry covered in the book, the coverage of each of them is, at times, shallow; for instance, reviewer Theodore G. Ostrom complains that there is only half a page on non-Desarguesian planes.[2] Additionally, Kallaher feels that block designs should have been included in place of some of the more esoteric geometries described by Batten.[1] Reviewer Thomas Brylawski criticizes the book for "glossing over or ignoring" important results, for overcomplicated proofs, and for missed cases in some of its case analysis.[4]
On the other hand, reviewer B. J. Wilson "enjoyed reading this book" and praises it for its "easily followed style", while reviewer R. J. M. Dawson writes that the book "succeeds admirably" in conveying to students "the living, active nature" of this area.[3]
Related books
editOther books on related topics include Finite Generalized Quadrangles by S. E. Payne and J. A. Thas, and Projective Planes by D. R. Hughes and F. C. Piper.[4]
References
edit- ^ a b c d e f g h Kallaher, M., "Review of Combinatorics of Finite Geometries (1st ed.)", zbMATH, Zbl 0608.51006
- ^ a b c d e Ostrom, T. G. (1987), "Review of Combinatorics of Finite Geometries (1st ed.)", Mathematical Reviews, MR 0842901
- ^ a b c Wilson, B. J. (January 1987), "Review of Combinatorics of Finite Geometries (1st ed.)", Bulletin of the London Mathematical Society, 19 (1): 85–86, doi:10.1112/blms/19.1.85
- ^ a b c Brylawski, Thomas (May–June 1988), "Review of Combinatorics of Finite Geometries (1st ed.)", American Scientist, 76 (3): 314, JSTOR 27855272
- ^ a b c d Dawson, R., "Review of Combinatorics of Finite Geometries (2nd)", zbMATH, Zbl 0885.51012
- ^ a b c Szőnyi, Tamás (1999), "Review of Combinatorics of Finite Geometries (2nd ed.)", Mathematical Reviews, MR 1474497