Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
From MaRDI portal
Publication:4907109
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Symmetry properties of polytopes (52B15)
Recommendations
Cites work
- Closed forms for the number of polygon dissections
- Enumeration of Triangulations of the Disk
- Historical Note on a Recurrent Combinatorial Problem
- scientific article; zbMATH DE number 3688748 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On general dissections of a polygon
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- The associahedron and triangulations of the \(n\)-gon
- The Gromov norm of the product of two surfaces
- Triangular Dissections of N-Gons
- Triangulations. Structures for algorithms and applications
This page was built for publication: Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907109)