Lessons in enumerative combinatorics
From MaRDI portal
Formal languages and automata (68Q45) Trees (05C05) Exact enumeration problems, generating functions (05A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Recommendations
Cited in
(9)- An Euler-like product with Fibonacci exponents
- Lectures on advances in combinatorics
- Inquiry-based enumerative combinatorics. One, two, skip a few\dots ninety-nine, one hundred
- Pattern avoidance and Schur-positivity in restricted-growth words of type B
- A parity-sum statistic and q-Euler numbers
- Markov chains generating random permutations and set partitions
- Combinatorics of q, r-analogues of Stirling numbers of type B
- Lattice path combinatorics and special counting sequences. From an enumerative perspective
- On languages generated by signed grammars
This page was built for publication: Lessons in enumerative combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858576)