Counting symmetry classes of dissections of a convex regular polygon

DOI10.1016/J.AAM.2014.01.004MaRDI QIDQ402579zbMATH OpenOpenAlexWikidataFDO

Authors Douglas Bowman, Alon Regev

Publication date 28 August 2014

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

triangulationsassociahedronconvex regular polygonpolygon dissections

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18) Symmetry properties of polytopes (52B15) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Abstract: This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections between rotationally symmetric dissections and simpler classes of dissections. A number of special cases of these formulas are studied. Consequently, some known enumerations are recovered and several new ones are provided.

Recommendations

• Classifying simplicial dissections of convex polyhedra with symmetry
• scientific article; zbMATH DE number 3953704
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• scientific article; zbMATH DE number 1795967
• Counting polygon dissections in the projective plane
• Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
• A class of symmetric polytopes
• On a symmetry problem for polygons
• Counting symmetric colourings of the vertices of a regular polygon
• scientific article; zbMATH DE number 6756979

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 2061970 (Why is no real title available?)
• A Course in Enumeration
• Cellular structures determined by polygons and trees
• Closed forms for the number of polygon dissections
• Combinatorial families enumerated by quasi-polynomials
• Counting cluster-tilted algebras of type $A_n$
• Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
• Enumeration of Triangulations of the Disk
• Many non-equivalent realizations of the associahedron
• On general dissections of a polygon
• Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
• The associahedron and triangulations of the \(n\)-gon
• Triangular Dissections of N-Gons

Cited in

(11)

• The \(S_{n+1}\) action on spherical models and supermaximal models of tipe \(A_{n-1}\)
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
• Counting polygon dissections in the projective plane
• Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
• Decompositions of a polygon into centrally symmetric pieces
• Brown's theorem and its application for enumeration of dissections and planar trees
• Closed forms for the number of polygon dissections
• Counting quiddities of polygon dissections
• scientific article; zbMATH DE number 6756979 (Why is no real title available?)
• Recurrent neural networks as optimal mesh refinement strategies

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting symmetry classes of dissections of a convex regular polygon

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