Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.01270

Farey Structure in Modulo Krinkle Tilings: Mediant Splicing and Generation of Prototiles from a Single Edge

Mikihiro Fujiwara
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Modulo Krinkle tilings of Imura (arXiv:2506.07638) form a family of non-periodic, spiral monohedral tilings parametrized by a reduced fraction $m/k$ and an integer $t\ge 2$. We show that the Farey sum (mediant) $(m_1+m_2)/(k_1+k_2)$ of two Farey-adjacent parameters is realized by an exact geometric operation on prototiles: the lower boundary path of the $(m_1+m_2,k_1+k_2)$-prototile is obtained by concatenating the parents' lower paths after an edge-length-preserving progressive rotation (fan-twist) of their edges. Conversely, every prototile admits exactly one fan-twist splice decomposition -- no non-adjacent parameters ever splice -- the cut position being $k_1=m^{-1}\bmod k$, and the recursion descends the Stern-Brocot tree to a single unit edge. The combinatorial core of the operation is the classical standard factorization of Christoffel words; the contribution here is its exact edge-isometric realization on circular direction systems and the resulting structure theory for the Modulo Krinkle family, including the recently introduced variants: we prove a separation theorem stating that every variant prototile is the common recursively-generated core plus finitely many direction-invariant decoration edges. As a corollary of Imura's spiral-arm count formula, the two Farey parents are visible in the offset-free tiling itself: the numbers of counterclockwise and clockwise spiral arms are $tk_1$ and $tk_2$.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikihiro Fujiwara. 2026-09-01. Farey Structure in Modulo Krinkle Tilings: Mediant Splicing and Generation of Prototiles from a Single Edge. https://arxiv.org/abs/2609.01270

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

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗