The analysis finds a clear divide in how these colored polygon configurations connect. With three colors, the twist graph H(3k + 2) is connected for every k ≥ 4, but H8 and H11 are disconnected. With four or more colors, the corresponding validity-preserving flip graph is connected whenever valid triangulations exist.
A puzzle built from exact rules
The work studies valid triangulations of convex polygons whose vertices carry cyclic colors, using j ≥ 3 colors. A triangulation is valid only when every triangle contains three pairwise distinct colors.
This is not an empirical sample. The analyzed objects are mathematically defined valid triangulations and the reconfiguration graphs built from them. Those graphs ask whether the permitted twists or flips can connect the configurations.
The authors organize the problem with a colored root-edge decomposition. The third vertex of the base triangle is constrained by its color and congruence class, which determines two subproblems.
Three colors produce the exceptions
For j = 3, the paper’s connectivity statement is precise: H(3k + 2) is connected for every k ≥ 4, whereas H8 and H11 are disconnected.
The counting problem follows a related three-color pattern. The families T(3k) and T(3k + 2) satisfy coupled recurrences, so the two residue classes are handled together.
The resulting generating functions reduce to the compact equation U(x) = 1 + xU(x)^4. In plain terms, a generating function packages a sequence of counts into one formal expression; the quartic equation is the paper’s compact description of this three-color system.
The authors also express the gap between the counting families through Raney numbers: for every k ≥ 1, T(3k + 3) − T(3k + 2) equals R4,5(k − 1).
Closed formulas are reported for both three-color families. For T(3k), the expression has coefficient 2/(3k − 1) with binomial entries 4k − 3 and k − 1, for k ≥ 1; for T(3k + 2), it has coefficient 1/(3k + 1) with binomial entries 4k and k, for k ≥ 0.
Four or more colors change the graph picture
From four colors onward, the study considers flips that preserve the validity rule. For j ≥ 4, the flip graph is connected for every admissible polygon order—in other words, whenever valid triangulations exist.
The general recurrence is organized by writing the polygon order as n = jk + r, with k ≥ 1, 0 ≤ r ≤ j − 1, and r ≠ 1. This residue-class structure extends the root-edge analysis.
For each fixed j ≥ 4, separating the count by residue classes produces a finite algebraic system of functional equations. In the j = 4 specialization, an auxiliary series Z(x) satisfies Z(x) = x(1 + Z(x))^2(2 + Z(x))^3.
What the paper leaves open
The larger-color story is not yet reduced to one uniform formula. For larger j, the authors do not know whether the coupled systems collapse to a single functional equation or yield a uniform closed formula.
The paper also draws a careful boundary around a comparison with achiral pentagonal polyominoes. The correspondence rests only on equality of closed formulas; no direct bijection is claimed.
Taken together, the results present the root-edge decomposition as a common structural framework supporting the three-color twist analysis, the higher-color flip connectedness result, and the residue-based counting systems.
The supplied document is an arXiv version 1 preprint dated 26 August 2026.
Paper data and sources
Original title: Cyclically Colored Triangulations: Enumeration and Connectedness of Reconfiguration Graphs
Authors: Daniel Debrohim, Diana Sasaki, Patrícia Nunes
Journal/Repository: arXiv
Status: Preprint, not yet peer-reviewed
First online: 2026-08-26
DOI: Not available
Original paper · Full text