Search arXivSearch

arXiv · 2601.14585

Star Decompositions of a Cyclic Polygon

Abstract

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

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomoki Nakamigawa. 2026-01-21. Star Decompositions of a Cyclic Polygon. https://arxiv.org/abs/2601.14585

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO