| 000 | 02346cam a2200265 a 4500 | ||
|---|---|---|---|
| 005 | 20160322165154.0 | ||
| 008 | 100617s2011 flua b 001 0 eng | ||
| 020 | _a9781420082609 (hardcover : alk. paper) | ||
| 020 | _a1420082604 (hardcover : alk. paper) | ||
| 041 | _aeng | ||
| 082 | 0 | 0 |
_a519.11 _bALL |
| 100 | 1 |
_aAllenby, R. B. J. T. _9434 |
|
| 245 | 1 | 0 |
_aHow to count : _ban introduction to combinatorics / _cR.B.J.T. Allenby, Alan Slomson. |
| 250 | _a2nd ed. | ||
| 260 |
_aBoca Raton, FL : _bCRC Press, _cc2011. |
||
| 300 | _axv, 430 p. : | ||
| 490 | 1 | _aDiscrete mathematics and its applications | |
| 500 | _aFirst published as: an introduction to combinatorics, 1991. | ||
| 505 | 0 | _aWhat's it all about? -- Permutations and combinations -- Occupancy problems -- The inclusion-exclusion principle -- Stirling and Catalan numbers -- Partitions and dot diagrams -- Generating functions and recurrence relations -- Partitions and generating functions -- Introduction to graphs -- Trees -- Groups of permutations -- Group actions -- Counting patterns -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings. | |
| 520 | _a"Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya's counting theorem."--Publisher's description. | ||
| 650 | 0 |
_aCombinatorial analysis. _9435 |
|
| 700 | 1 |
_aSlomson, A. B. _9436 |
|
| 700 | 1 |
_aSlomson, A. B. _9437 |
|
| 942 | _cBK | ||
| 999 |
_c155502 _d155502 |
||