Counting genus one partitions and permutations

zbMATH Open1297.05026arXiv1306.4628MaRDI QIDQ402603FDOQ402603

Gabor Hetyei, Robert Cori

Publication date: 28 August 2014

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

Abstract: We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof involves representing each genus one permutation by a four-colored noncrossing partition. This representation may be selected in a unique way for permutations containing no trivial cycles. The conclusion follows from a general generating function formula that holds for any class of permutations that is closed under the removal and reinsertion of trivial cycles. Our method also provides a new way to count rooted hypermonopoles of genus one, and puts the spotlight on a class of genus one permutations that is invariant under an obvious extension of the Kreweras duality map to genus one permutations.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

noncrossing partitionsset partitionsgenus of a hypermap

Mathematics Subject Classification ID

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

Cited In (9)

• Classification of uniform flag triangulations of the boundary of the full root polytope of type A
• Realizing Simion's type \(B\) associahedron as a pulling triangulation of the Legendre polytope
• Counting partitions of a fixed genus
• Simion's type \(B\) associahedron is a pulling triangulation of the Legendre polytope
• Counting non-crossing permutations on surfaces of any genus
• Refined face count in uniform triangulations of the Legendre polytope
• Title not available (Why is that?)
• On enumeration of families of genus zero permutations
• Counting partitions by genus. I. Genus 0 to 2

Uses Software

• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402603)