Counting genus one partitions and permutations

zbMath1297.05026arXiv1306.4628MaRDI QIDQ402603

Gábor Hetyei, Robert Cori

Publication date: 28 August 2014

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

set partitionsnoncrossing partitionsgenus of a hypermap

Mathematics Subject Classification ID

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

Related Items (8)

Classification of uniform flag triangulations of the boundary of the full root polytope of type A ⋮ Counting partitions of a fixed genus ⋮ Unnamed Item ⋮ Counting non-crossing permutations on surfaces of any genus ⋮ Realizing Simion's type \(B\) associahedron as a pulling triangulation of the Legendre polytope ⋮ Simion's type \(B\) associahedron is a pulling triangulation of the Legendre polytope ⋮ On enumeration of families of genus zero permutations ⋮ Refined face count in uniform triangulations of the Legendre polytope

Uses Software

• OEIS

This page was built for publication: Counting genus one partitions and permutations