Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron

DOI10.1090/S0002-9939-2012-11626-0zbMath1259.05080MaRDI QIDQ4907109

Alon Regev, Douglas Bowman

Publication date: 4 March 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

generating functionnumber of edgesassiciahedronnumber of 2-setsnumber of diagonals

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Enumeration in graph theory (05C30) Symmetry properties of polytopes (52B15) Group actions on combinatorial structures (05E18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)

Related Items (1)

Counting symmetry classes of dissections of a convex regular polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulations. Structures for algorithms and applications
• On general dissections of a polygon
• The Gromov norm of the product of two surfaces
• The associahedron and triangulations of the \(n\)-gon
• Closed forms for the number of polygon dissections
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Enumeration of Triangulations of the Disk
• Historical Note on a Recurrent Combinatorial Problem
• Triangular Dissections of N-Gons

This page was built for publication: Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron