Enumerating triangulations by parallel diagonals
From MaRDI portal
Publication:5404255
zbMATH Open1292.05035arXiv1208.3915MaRDI QIDQ5404255FDOQ5404255
Authors: Alon Regev 
Publication date: 24 March 2014
Abstract: The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of triangulations.
Full work available at URL: https://arxiv.org/abs/1208.3915
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Geometric classification of triangulations and their enumeration in a convex polygon
- Enumerating triangulation paths
- Explicit enumeration of triangulations with multiple boundaries
- A bijection for triangulations of a polygon with interior points and multiple edges
- Counting triangulations of some classes of subdivided convex polygons
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Cited In (6)
- Enumerating triangulation paths
- Title not available (Why is that?)
- Enumerating pseudo-triangulations in the plane
- Triangulations with few ears: symmetry classes and disjointness
- Colored partitions of a convex polygon by noncrossing diagonals
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers
Uses Software
This page was built for publication: Enumerating triangulations by parallel diagonals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404255)
