Counting quiddities of polygon dissections
From MaRDI portal
Abstract: We formulate the following general problem. To the best of our knowledge, it is open and has not previously been considered. It seems (at least to us!) to be difficult; at any rate, more difficult than enumerating the dissections themselves. Enumerate the distinct quiddities of dissections of the -gon into cells.
Recommendations
Cites work
- A four-vertex theorem for frieze patterns?
- Analytic combinatorics of non-crossing configurations
- Counting symmetry classes of dissections of a convex regular polygon
- Farey boat: continued fractions and triangulations, modular group and polygon dissections
- Frieze patterns of integers
- Nested sets, set partitions and Kirkman-Cayley dissection numbers
- On general dissections of a polygon
- Partitions of unity in \(\mathrm{SL}(2,\mathbb Z)\), negative continued fractions, and dissections of polygons
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- Polygon dissections and standard Young tableaux
- The classical moment problem as a self-adjoint finite difference operator
- Triangulated polygons and frieze patterns
This page was built for publication: Counting quiddities of polygon dissections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121463)