044 209 91 25 079 869 90 44
Notepad
The notepad is empty.
The basket is empty.
Free shipping possible
Free shipping possible
Please wait - the print view of the page is being prepared.
The print dialogue opens as soon as the page has been completely loaded.
If the print preview is incomplete, please close it and select "Print again".

Combinatorics and Finite Geometry

BookPaperback
Ranking16631inMathematik
CHF52.90

Description

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.
More descriptions

Details

ISBN/GTIN978-3-030-56394-3
Product TypeBook
BindingPaperback
Publishing date31/10/2020
Edition20001 A. 1st ed. 2020
Pages388 pages
LanguageEnglish
SizeWidth 155 mm, Height 235 mm, Thickness 21 mm
Weight587 g
Article no.32009946
CatalogsBuchzentrum
Data source no.35033143
Product groupMathematik
More details

Series

Author

Steven Dougherty is a Professor at the University of Scranton, Pennsylvannia. The author of over 100 papers and 2 books, he has lectured over 60 times in 11 countries and was awarded the 2005 Merten M. Hasse prize.