| 000 | 03379cam a2200541Ki 4500 | ||
|---|---|---|---|
| 001 | 9781315122656 | ||
| 003 | FlBoTFG | ||
| 005 | 20220509192932.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 190821s2020 flu ob 001 0 eng d | ||
| 040 |
_aOCoLC-P _beng _erda _epn _cOCoLC-P |
||
| 020 |
_a9781315122656 _q(electronic bk.) |
||
| 020 |
_a1315122650 _q(electronic bk.) |
||
| 020 |
_a9781351346375 _q(electronic bk. : EPUB) |
||
| 020 |
_a1351346377 _q(electronic bk. : EPUB) |
||
| 020 |
_a9781351346382 _q(electronic bk. : PDF) |
||
| 020 |
_a1351346385 _q(electronic bk. : PDF) |
||
| 020 |
_a9781351346368 _q(electronic bk. : Mobipocket) |
||
| 020 |
_a1351346369 _q(electronic bk. : Mobipocket) |
||
| 020 | _z9781138564855 | ||
| 020 | _z1138564850 | ||
| 035 | _a(OCoLC)1112671784 | ||
| 035 | _a(OCoLC-P)1112671784 | ||
| 050 | 4 |
_aQA164.5 _b.M49 2020eb |
|
| 072 | 7 |
_aCOM _x083000 _2bisacsh |
|
| 072 | 7 |
_aMAT _x000000 _2bisacsh |
|
| 072 | 7 |
_aMAT _x022000 _2bisacsh |
|
| 072 | 7 |
_aPBV _2bicssc |
|
| 082 | 0 | 4 |
_a511/.6 _223 |
| 100 | 1 |
_aMezõ, István, _eauthor. |
|
| 245 | 1 | 0 |
_aCombinatorics and number theory of counting sequences / _cIstvan Mezo. |
| 264 | 1 |
_aBoca Raton : _bCRC Press, Taylor & Francis Group, _c2020. |
|
| 300 |
_a1 online resource (1 volume) : _billustrations (black and white). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 0 | _aDiscrete mathematics and its applications | |
| 520 | _aCombinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time. | ||
| 588 | _aOCLC-licensed vendor bibliographic record. | ||
| 650 | 0 |
_aCombinatorial analysis _vTextbooks. |
|
| 650 | 0 |
_aNumber theory _vTextbooks. |
|
| 650 | 0 |
_aSequences (Mathematics) _vTextbooks. |
|
| 650 | 7 |
_aCOMPUTERS / Cryptography _2bisacsh |
|
| 650 | 7 |
_aMATHEMATICS / General _2bisacsh |
|
| 650 | 7 |
_aMATHEMATICS / Number Theory _2bisacsh |
|
| 856 | 4 | 0 |
_3Taylor & Francis _uhttps://www.taylorfrancis.com/books/9781315122656 |
| 856 | 4 | 2 |
_3OCLC metadata license agreement _uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf |
| 999 |
_c126849 _d126849 |
||