| 000 | 01843cam a2200349 i 4500 | ||
|---|---|---|---|
| 001 | 19543584 | ||
| 003 | OSt | ||
| 005 | 20240809100913.0 | ||
| 008 | 170308t20172017flua 000 0 eng | ||
| 020 | _a9781498780254 | ||
| 020 | _a1498780253 | ||
| 040 |
_aDLC _beng _cDLC _erda _dDLC |
||
| 050 | 0 |
_aQA 43 _bL64 2018 |
|
| 100 | 1 |
_aLoehr, Nicholas A. _eauthor |
|
| 240 | 0 | 0 | _aBijective combinatorics |
| 245 | 0 | 0 |
_aCombinatorics / _cNicholas A. Loehr. |
| 250 | _aSecond edition. | ||
| 264 | 1 |
_aBoca Raton : _bCRC Press, Taylor & Francis Group, _c[2017] |
|
| 264 | 1 | _c©2017 | |
| 300 |
_axxiv, 618 pages : _billustrations ; _c27 cm. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 500 | _a"A Chapman & Hall book." | ||
| 500 | _aPrevious edition: Bijective combinatorics / Nicholas A. Loehr (Boca Raton, FL : Chapman & Hall/CRC, c2011). | ||
| 504 | _aIncludes bibliographical references (pages 595-601) and index. | ||
| 520 | _aBijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods. The text develops mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods to solve enumeration problems. The tools are used to analyze combinatorial structures, words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, and set partitions. -- | ||
| 650 | 1 | 0 | _aCombinatorial analysis. |
| 650 | 1 | 0 | _2Mathematics |
| 700 | 1 |
_aLoehr, Nicholas A. _tBijective combinatorics. |
|
| 942 |
_2lcc _cBK |
||
| 999 |
_c3394 _d3394 |
||