On typical triangulations of a convex n-gon

DOI10.4310/JOC.2021.V12.N3.A2arXiv1911.04025MaRDI QIDQ6328892FDOQ6328892

Reza Rastegar, Toufik Mansour

Publication date: 10 November 2019

Abstract: Let $f_n$ be a function assigning weight to each possible triangle whose vertices are chosen from vertices of a convex polygon $P_n$ of $n$ sides. Suppose ${mathcalT}_n$ is a random triangulation, sampled uniformly out of all possible triangulations of $P_n$. We study the sum of weights of triangles in ${mathcalT}_n$ and give a general formula for average and variance of this random variable. In addition, we look at several interesting special cases of $f_n$ in which we obtain explicit forms of generating functions for the sum of the weights. For example, among other things, we give new proofs for already known results such as the degree of a fixed vertex and the number of ears in ${mathcalT}_n,$ as well as, provide new results on the number of "blue" angles and refined information on the distribution of angles at a fixed vertex. We note that our approach is systematic and can be applied to many other new examples while generalizing the existing results.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Convex sets in (2) dimensions (including convex curves) (52A10) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Combinatorial complexity of geometric structures (52C45)

This page was built for publication: On typical triangulations of a convex $n$-gon

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