English

Star Decompositions of a Cyclic Polygon

Combinatorics 2026-01-22 v1

Abstract

Let VV be a set of vertices on a circumference in the plane. Let EE be a set of directed line segments linking two vertices of VV. If EE forms a set of closed cycles and for all two adjacent edges uvuv and vwvw, the vertices uu, vv, ww are arranged in anti-clockwise order, we call P(V,E)P(V,E) a cyclic polygon. A star decomposition S\mathcal{S} of a cyclic polygon PP is a set of star polygons partitioning the region of PP with some additional diagonals. A star decomposition S\mathcal{S} is called maximal if there is no other star decomposition S\mathcal{S}' such that a set of diagonals of S\mathcal{S} is a proper subset of that of S\mathcal{S}'. In this paper, it is shown that for any two maximal star decompositions S1\mathcal{S}_1 and S2\mathcal{S}_2 of a common cyclic polygon, S1\mathcal{S}_1 can be transformed into S2\mathcal{S}_2 by a finite sequence of diagonal flips. It is also shown that if a cyclic polygon PP admits a star decomposition, the number of diagonals contained in a maximal star decomposition of PP is p(n2r)(n2r1)/2p - (n-2r)(n-2r-1)/2, where pp is the number of all possible diagonals of PP, nn is the number of vertices of PP, and rr is the rotation number of PP.

Cite

@article{arxiv.2601.14585,
  title  = {Star Decompositions of a Cyclic Polygon},
  author = {Tomoki Nakamigawa},
  journal= {arXiv preprint arXiv:2601.14585},
  year   = {2026}
}

Comments

16 pages, 12 figures

R2 v1 2026-07-01T09:13:26.292Z