000 02347nam a22003977a 4500
003 IIITD
005 20250429101509.0
008 250427b |||||||| |||| 00| 0 eng d
020 _a9783030563943
040 _aIIITD
082 _a516.13
_bDOU-C
100 _aDougherty, Steven T.
245 _aCombinatorics and finite geometry
_cby Steven T. Dougherty
260 _aSwitzerland :
_bSpringer,
_c©2020
300 _axv, 369 p. :
_bill. ;
_c24 cm.
440 _aSpringer undergraduate mathematics series
504 _aIncludes bibliographical references and index
505 _t1. Foundational combinatorial structures
505 _t2. Foundational algebraic structures
505 _t3. Mutually orthogonal latin squares
505 _t4. Affine and projective planes
505 _t5. Graphs
505 _t6. Higher dimensional finite geometry
505 _t7. Designs
505 _t8. Combinatorial objects
505 _t9. Discrete probability - a return to counting
505 _t10. Automorphism groups
505 _t11. Codes
505 _t12. Cryptology
505 _t13. Games and designs
520 _aThis 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.
650 _aAlgebraic geometry
650 _aDiscrete geometry
650 _aConvex and Discrete Geometry
942 _cBK
_2ddc
999 _c189947
_d189947