Triangulations with few ears: symmetry classes and disjointness
Andrei Asinowski, Alon Regev

TL;DR
This paper studies triangulations of convex polygons with few ears, analyzing their symmetry classes and disjointness properties, and provides explicit counts for cases with two or three ears.
Contribution
It determines the number of symmetry classes and disjoint triangulations for polygons with two or three ears, revealing dependence on polygon size and branch lengths.
Findings
Number of symmetry classes for 2 and 3 ears
Count of disjoint triangulations depending on n or branch lengths
Structural insights into triangulations with few ears
Abstract
An ear in a triangulation of a convex -gon is a triangle of that shares two sides with itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We demonstrate this in two ways. First, for , we find the number of symmetry classes of triangulations with ears. Second, for , we determine the number of triangulations disjoint from a given triangulation: this number depends only on for , and only on lengths of branches of the dual tree for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research · Topological and Geometric Data Analysis
