國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorics and finite geometry

Dougherty, Steven T.

Combinatorics and finite geometry

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorics and finite geometryby Steven T. Dougherty.
作者:	Dougherty, Steven T.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xv, 369 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysis.
電子資源:	https://doi.org/10.1007/978-3-030-56395-0
ISBN:	9783030563950$q(electronic bk.)

Combinatorics and finite geometry
Dougherty, Steven T.

Combinatorics and finite geometry[electronic resource] /by Steven T. Dougherty. - Cham :Springer International Publishing :2020. - xv, 369 p. :ill., digital ;24 cm. - Springer undergraduate mathematics series,1615-2085. - Springer undergraduate mathematics series..

1 Foundational Combinatorial Structures -- 2 Foundational Algebraic Structures -- 3 Mutually Orthogonal Latin Squares -- 4 Affine and Projective Planes -- 5 Graphs -- 6 Higher Dimensional Finite Geometry -- 7 Designs -- 8 Combinatorial Objects -- 9 Discrete Probability - A Return to Counting -- 10 Automorphism Groups -- 11 Codes -- 12 Cryptology -- 13 Games and Designs -- 14 Epilogue -- References -- Glossary -- Solutions to Selected Odd Problems -- Index.

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.

ISBN: 9783030563950$q(electronic bk.)

Standard No.: 10.1007/978-3-030-56395-0doiSubjects--Topical Terms:

182280
Combinatorial analysis.

LC Class. No.: QA167.2 / .D68 2020

Dewey Class. No.: 516.13

Combinatorics and finite geometry
LDR:02567nmm a2200337 a 4500 001 589011
003 DE-He213
005 20210204133951.0
006 m d
007 cr nn 008maaau
008 210525s2020 sz s 0 eng d
020 $a 9783030563950$q(electronic bk.)
020 $a 9783030563943$q(paper)
024 7 $a 10.1007/978-3-030-56395-0 $2 doi
035 $a 978-3-030-56395-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA167.2 $b .D68 2020
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 516.13 $2 23
090 $a QA167.2 $b .D732 2020
100 1 $a Dougherty, Steven T. $3 789670
245 1 0 $a Combinatorics and finite geometry $h [electronic resource] / $c by Steven T. Dougherty.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xv, 369 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer undergraduate mathematics series, $x 1615-2085
505 0 $a 1 Foundational Combinatorial Structures -- 2 Foundational Algebraic Structures -- 3 Mutually Orthogonal Latin Squares -- 4 Affine and Projective Planes -- 5 Graphs -- 6 Higher Dimensional Finite Geometry -- 7 Designs -- 8 Combinatorial Objects -- 9 Discrete Probability - A Return to Counting -- 10 Automorphism Groups -- 11 Codes -- 12 Cryptology -- 13 Games and Designs -- 14 Epilogue -- References -- Glossary -- Solutions to Selected Odd Problems -- Index.
520 $a 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.
650 0 $a Combinatorial analysis. $3 182280
650 0 $a Finite geometries. $3 483667
650 1 4 $a Discrete Mathematics. $3 524738
650 2 4 $a Convex and Discrete Geometry. $3 277230
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Springer undergraduate mathematics series. $3 544774
856 4 0 $u https://doi.org/10.1007/978-3-030-56395-0
950 $a Mathematics and Statistics (SpringerNature-11649)