Indecomposable permutations, hypermaps and labeled Dyck paths
DOI10.1016/j.jcta.2009.02.008zbMath1203.05003arXiv0812.0440OpenAlexW2043822055MaRDI QIDQ1040846
Publication date: 26 November 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.0440
permutationsStirling numbersenumerationDyck pathsgraph embeddingorientable surfacehypermapscombinatorial mapsbijective proofs
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (13)
Uses Software
Cites Work
- Structure of the Malvenuto-Reutenauer Hopf algebra of permutations
- Transitivity and connectivity of permutations
- The combinatorics of associated Hermite polynomials
- The Riemann-Hurwitz formula for the centralizer of a pair of permutations
- Hypermaps versus bipartite maps
- Maps, hypermaps and their automorphisms: A survey. III
- Combinatorial theory of \(\text{T}\)-fractions and two points Padé approximants
- Rooted maps on orientable surfaces, Riccati's equation and continued fractions
- Théorie géométrique des polynômes eulériens
- Counting rooted maps by genus. I
- Asymptotics of generating the symmetric and alternating groups.
- Spaces of Subgroups and Teichmüller Space
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS VI: FREE QUASI-SYMMETRIC FUNCTIONS AND RELATED ALGEBRAS
- A Census of Planar Maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Indecomposable permutations, hypermaps and labeled Dyck paths