|
|
|
|
| LEADER |
00000cam a2200000Mu 4500 |
| 001 |
EBOOKCENTRAL_on1347027951 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr cnu|||||||| |
| 008 |
230209s2013 xx o ||| 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|c EBLCP
|d OCLCQ
|d OCLCO
|d EBLCP
|d OCLCQ
|d OCLCL
|d OCLCQ
|
| 020 |
|
|
|a 9781118637586
|
| 020 |
|
|
|a 1118637585
|
| 035 |
|
|
|a (OCoLC)1347027951
|
| 082 |
0 |
4 |
|a 511/.6
|q OCoLC
|2 23/eng/20230216
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Erickson, Martin J.
|
| 245 |
1 |
0 |
|a Introduction to Combinatorics
|h [electronic resource].
|
| 260 |
|
|
|a Newark :
|b John Wiley & Sons, Incorporated,
|c 2013.
|
| 300 |
|
|
|a 1 online resource (225 p.).
|
| 490 |
1 |
|
|a New York Academy of Sciences Ser. ;
|v v.78
|
| 500 |
|
|
|a Description based upon print version of record.
|
| 505 |
0 |
|
|a Intro -- Half Title page -- Title page -- Copyright page -- Dedication -- Preface -- Chapter 1: Basic Counting Methods -- 1.1 The multiplication principle -- 1.2 Permutations -- 1.3 Combinations -- 1.4 Binomial coefficient identities -- 1.5 Distributions -- 1.6 The principle of inclusion and exclusion -- 1.7 Fibonacci numbers -- 1.8 Linear recurrence relations -- 1.9 Special recurrence relations -- 1.10 Counting and number theory -- Notes -- Chapter 2: Generating Functions -- 2.1 Rational generating functions -- 2.2 Special generating functions -- 2.3 Partition numbers
|
| 505 |
8 |
|
|a 2.4 Labeled and unlabeled sets -- 2.5 Counting with symmetry -- 2.6 Cycle indexes -- 2.7 Pólya's theorem -- 2.8 The number of graphs -- 2.9 Symmetries in domain and range -- 2.10 Asymmetric graphs -- Notes -- Chapter 3: The Pigeonhole Principle -- 3.1 The principle -- 3.2 The lattice point problem and SET® -- 3.3 Graphs -- 3.4 Colorings of the plane -- 3.5 Sequences and partial orders -- 3.6 Subsets -- Notes -- Chapter 4: Ramsey Theory -- 4.1 Ramsey's theorem -- 4.2 Generalizations of Ramsey's theorem -- 4.3 Ramsey numbers, bounds, and asymptotics -- 4.4 The probabilistic method
|
| 505 |
8 |
|
|a 4.5 Schur's theorem -- 4.6 Van der Waerden's theorem -- Notes -- Chapter 5: Error-Correcting Codes -- 5.1 Binary codes -- 5.2 Perfect codes -- 5.3 Hamming codes -- 5.4 The Fano Configuration -- Notes -- Chapter 6: Combinatorial Designs -- 6.1 t-designs -- 6.2 Block designs -- 6.3 Projective planes -- 6.4 Latin squares -- 6.5 MOLS and OODs -- 6.6 Hadamard matrices -- 6.7 The Golay code and S(5, 8, 24) -- 6.8 Lattices and sphere packings -- 6.9 Leech's lattice -- Notes -- Appendix A: Web Resources -- Appendix B: Notation -- Exercise Solutions -- References -- Index
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 655 |
|
0 |
|a Electronic books.
|
| 758 |
|
|
|i has work:
|a Introduction to combinatorics (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGfb7pBtHF9rJjYPCcfhd3
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Erickson, Martin J.
|t Introduction to Combinatorics
|d Newark : John Wiley & Sons, Incorporated,c2013
|z 9781118637531
|
| 830 |
|
0 |
|a New York Academy of Sciences Ser.
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=7103910
|z Texto completo
|
| 938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL7103910
|
| 994 |
|
|
|a 92
|b IZTAP
|
