Counting partitions of a fixed genus

zbMath1402.05101arXiv1710.09992MaRDI QIDQ1627201

Robert Cori, Gábor Hetyei

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.09992

zbMATH Keywords

set partitionsnoncrossing partitionsgenus of a hypermap

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ Counting non-crossing permutations on surfaces of any genus ⋮ On enumeration of families of genus zero permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting genus one partitions and permutations
• The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
• Delannoy orthants of Legendre polytopes
• Factoring \(n\)-cycles and counting maps of given genus
• A type-B associahedron.
• Counting rooted maps by genus. I
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• On Tutte’s chromatic invariant
• A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
• Character Theory and Rooted Maps in an Orientable Surface of Given Genus: Face-Colored Maps
• Maps in Locally Orientable Surfaces, the Double Coset Algebra, and Zonal Polynomials