Projective geometry is not only a jewel of mathematics, but has also many applications in modern information and communication science. This book presents the foundations of classical projective and affine geometry as well as its important applications in coding theory and cryptography. It also could serve as a first acquaintance with diagram geometry. Written in clear and contemporary language with an entertaining style and around 200 exercises, examples and hints, this book is ideally suited to be used as a textbook for study in the classroom or on its own.

The content of Geometry with an Introduction to Cosmic Topology is motivated by questions that have ignited the imagination of stargazers since antiquity. What is the shape of the universe? Does the universe have and edge? Is it infinitely big? Dr. Hitchman aims to clarify this fascinating area of mathematics. This non-Euclidean geometry text is organized intothree natural parts. Chapter 1 provides an overview including a brief history of Geometry, Surfaces, and reasons to study Non-Euclidean Geometry. Chapters 2-7 contain the core mathematical content of the text, following the ErlangenProgram, which develops geometry in terms of a space and a group of transformations on that space. Finally chapters 1 and 8 introduce (chapter 1) and explore (chapter 8) the topic of cosmic topology through the geometry learned in the preceding chapters.

The techniques and concepts of modern algebra are introduced for their natural role in the study of projectile geometry; groups appear as automorphism groups of configurations, division rings appear in the study of Desargues' theorem and the study of the independence of the seven axioms given for projectile geometry.

The book is an innovative modern exposition of geometry, or rather, of geometries; it is the first textbook in which Felix Klein's Erlangen Program (the action of transformation groups) is systematically used as the basis for defining various geometries. The course of study presented is dedicated to the proposition that all geometries are created equal--although some, of course, remain more equal than others. The author concentrates on several of the more distinguished and beautiful ones, which include what he terms ``toy geometries'', the geometries of Platonic bodies, discrete geometries, and classical continuous geometries. The text is based on first-year semester course lectures delivered at the Independent University of Moscow in 2003 and 2006. It is by no means a formal algebraic or analytic treatment of geometric topics, but rather, a highly visual exposition containing upwards of 200 illustrations. The reader is expected to possess a familiarity with elementary Euclidean geometry, albeit those lacking this knowledge may refer to a compendium in Chapter 0. Per the author's predilection, the book contains very little regarding the axiomatic approach to geometry (save for a single chapter on the history of non-Euclidean geometry), but two Appendices provide a detailed treatment of Euclid's and Hilbert's axiomatics. Perhaps the most important aspect of this course is the problems, which appear at the end of each chapter and are supplemented with answers at the conclusion of the text. By analyzing and solving these problems, the reader will become capable of thinking and working geometrically, much more so than by simply learning the theory. Ultimately, the author makes the distinction between concrete mathematical objects called ``geometries'' and the singular ``geometry'', which he understands as a way of thinking about mathematics. Although the book does not address branches of mathematics and mathematical physics such as Riemannian and Kahler manifolds or, say, differentiable manifolds and conformal field theories, the ideology of category language and transformation groups on which the book is based prepares the reader for the study of, and eventually, research in these important and rapidly developing areas of contemporary mathematics.

This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject. The book is ideal for courses on combinatorical mathematics at the advanced undergraduate or beginning graduate level. Working mathematicians and scientists will also find it a valuable introduction and reference.