Combinatorics and Number Theory of Counting Sequences
DOI10.1201/9781315122656zbMath1445.05001OpenAlexW2951298535MaRDI QIDQ5381203
Publication date: 7 June 2019
Full work available at URL: https://doi.org/10.1201/9781315122656
inequalitiesgenerating functionsasymptoticsBernoulli numbersBell polynomialsset partitionsunimodalityCauchy numbersordered partitionspermutation cycleslog concavitylog convexity
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Binomial coefficients; factorials; (q)-identities (11B65) Combinatorial aspects of partitions of integers (05A17) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Asymptotic enumeration (05A16) Special sequences and polynomials (11B83) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01)
Related Items (12)
Uses Software
This page was built for publication: Combinatorics and Number Theory of Counting Sequences