|
|
|
|
| LEADER |
05249nmm a2200433 u 4500 |
| 001 |
EB001927063 |
| 003 |
EBX01000000000000001089965 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 9781118637500
|
| 020 |
|
|
|a 9781118637586
|
| 020 |
|
|
|a 9781118640210
|
| 020 |
|
|
|a 1118637585
|
| 020 |
|
|
|a 111863750X
|
| 020 |
|
|
|a 1118640217
|
| 050 |
|
4 |
|a QA164
|
| 100 |
1 |
|
|a Erickson, Martin J.
|
| 245 |
0 |
0 |
|a Introduction to combinatorics
|c Martin J. Erickson, Department of Mathematics and Computer Science, Truman State University, Kirksville, MO.
|
| 250 |
|
|
|a Second [edition]
|
| 260 |
|
|
|a Hoboken, New Jersey
|b Wiley
|c 2013
|
| 300 |
|
|
|a 1 online resource
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a Basic counting methods -- Generating functions -- The pigeonhole principle -- Ramsey theory -- Error-correcting codes -- Combinatorial designs
|
| 653 |
|
|
|a Analyse combinatoire
|
| 653 |
|
|
|a Combinatorial analysis / http://id.loc.gov/authorities/subjects/sh85028802
|
| 653 |
|
|
|a MATHEMATICS / Discrete Mathematics / bisacsh
|
| 653 |
|
|
|a Combinatorial analysis / fast
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 500 |
|
|
|a Machine generated contents note: Preface xi1 Basic Counting Methods 11.1 The multiplication principle 11.2 Permutations 41.3 Combinations 61.4 Binomial coefficient identities 101.5 Distributions 191.6 The principle of inclusion and exclusion 231.7 Fibonacci numbers 311.8 Linear recurrence relations 331.9 Special recurrence relations 411.10 Counting and number theory 45Notes 502 Generating Functions 532.1 Rational generating functions 532.2 Special generating functions 632.3 Partition numbers 762.4 Labeled and unlabeled sets 802.5 Counting with symmetry 862.6 Cycle indexes 932.7 Polya's theorem 962.8 The number of graphs 982.9 Symmetries in domain and range 1022.10 Asymmetric graphs 103Notes 1053 The Pigeonhole Principle 1073.1 Simple examples 1073.2 Lattice points, the Gitterpunktproblem, and SET(r) 1103.3 Graphs 1153.4 Colorings of the plane 1183.5 Sequences and partial orders 1193.6 Subsets 124Notes 1264 Ramsey Theory 1314.1 Ramsey's theorem 1314.2 Generalizations of Ramsey's theorem 1354.3 Ramsey numbers, bounds, and asymptotics 1394.4 The probabilistic method 1434.5 Sums 1454.6 Van der Waerden's theorem 146Notes 1505 Codes 1535.1 Binary codes 1535.2 Perfect codes 1565.3 Hamming codes 1585.4 The Fano Configuration 162Notes 1686 Designs 1716.1 t-designs 171CONTENTS ix6.2 Block designs 1756.3 Projective planes 1806.4 Latin squares 1826.5 MOLS and OODs 1856.6 Hadamard matrices 1886.7 The Golay code and S(5, 8, 24) 1946.8 Lattices and sphere packings 1976.9 Leech's lattice 199Notes 201A Web Resources 205B Notation 207Exercise Solutions 211References 225Index 227
|
| 776 |
|
|
|z 1118637534
|
| 776 |
|
|
|z 9781118637531
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781118637586/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 510
|
| 082 |
0 |
|
|a 511/.6
|
| 520 |
|
|
|a Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden's theorem on arithmetic progressions, Polya's graph enumeration formula, and Leech's 24-dimensional lattice.
|
| 520 |
|
|
|a Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideas A deeper, investigative study of combinatorics through exercises requiring the use of computer programs Over fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial concepts Basic principles and theories in combinatorics as well as new and innovative results in the field Introduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics"--
|
| 520 |
|
|
|a "Praise for the First Edition--"This excellent text should prove a useful accoutrement for any developing mathematics program. it's short, it's sweet, it's beautifully written."--The Mathematical Intelligencer"Erickson has prepared an exemplary work. strongly recommended for inclusion in undergraduate-level library collections."--ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin's sequence, Rook paths, and Leech's lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations.
|