Combinatorics And Finite Geometry

This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares, graphs and designs. The latter topic is closely related to finite geometry, which is developed in parallel. Applications to probability theory, algebra, coding theory, cryptology and combinatorial game theory comprise the later chapters. Throughout the book, examples and exercises illustrate the material, and the interrelations between the various topics is emphasized. Readers looking to take first steps toward the study of combinatorics, finite geometry, design theory, coding theory, or cryptology will find this book valuable. Essentially self-contained, there are very few prerequisites aside from some mathematical maturity, and the little algebra required is covered in the text. The book is also a valuable resource for anyone interested in discrete mathematics as it ties together a wide variety of topics.

This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares, graphs and designs. The latter topic is closely related to finite geometry, which is developed in parallel. Applications to probability theory, algebra, coding theory, cryptology and combinatorial game theory comprise the later chapters. Throughout the book, examples and exercises illustrate the material, and the interrelations between the various topics is emphasized. Readers looking to take first steps toward the study of combinatorics, finite geometry, design theory, coding theory, or cryptology will find this book valuable. Essentially self-contained, there are very few prerequisites aside from some mathematical maturity, and the little algebra required is covered in the text. The book is also a valuable resource for anyone interested in discrete mathematics as it ties together a wide variety of topics.

Thoroughly revised and updated, with an entirely new chapter on blocking sets in linear spaces.

This is a collection of thirty-five articles, covering topics such as finite projective spaces, generalized polygons, strongly regular graphs, diagram geometries, and polar spaces. Contained here are articles from many of the leading practitioners in the field including, for the first time, several distinguished Russian mathematicians. Many of the papers contain important new results and the growing use of computer algebra packages in this area is also demonstrated.

Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors thoroughly explain how the subject of finite geometries is a central part of discrete mathematics. The text is suitable for undergraduate and graduate courses. Additionally, it can be used as reference material on recent works. The authors examine how finite geometries’ applicable nature led to solutions of open problems in different fields, such as design theory, cryptography and extremal combinatorics. Other areas covered include proof techniques using polynomials in case of Desarguesian planes, and applications in extremal combinatorics, plus, recent material and developments. Features: Includes exercise sets for possible use in a graduate course Discusses applications to graph theory and extremal combinatorics Covers coding theory and cryptography Translated and revised text from the Hungarian published version

This textbook is intended as an introduction to the combinatorial theory of finite geometry for undergraduate students of mathematics. Although only a basic knowledge of set theory and analysis is assumed, the student is soon led Op results at the frontiers of research. Professor Batten begins with a discussion of near-linear spaces before proceeding to treat linear, projective and affine spaces. This half of the book in itself would be suitable for use as a text for a course in synthethic geometry. The remainder of the book is devoted to the relatively new areas of polar spaces, generalized quadrangles and partial geometries. These subjects are currently the focus of much research in combinatorial geometry.

Difference sets are of central interest in finite geometry and design theory. One of the main techniques to investigate abelian difference sets is a discrete version of the classical Fourier transform (i.e., character theory) in connection with algebraic number theory. This approach is described using only basic knowledge of algebra and algebraic number theory. It contains not only most of our present knowledge about abelian difference sets, but also gives applications of character theory to projective planes with quasiregular collineation groups. Therefore, the book is of interest both to geometers and mathematicians working on difference sets. Moreover, the Fourier transform is important in more applied branches of discrete mathematics such as coding theory and shift register sequences.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.