Optimal local convergence criteria for integer and Gaussian integer continued fractions

Technical Summary: Optimal Local Convergence Criteria for Integer and Gaussian Integer Continued Fractions

Problem Statement
The paper addresses the convergence of continued fractions with coefficients in the integers ($\mathbb{Z}$) and Gaussian integers ($\mathbb{Z}[i]$). Specifically, the authors seek to determine "optimal exclusion sets"—minimal sets of finite words (substrings) such that if a continued fraction contains only finitely many occurrences of these words, the fraction is guaranteed to converge. While it is known that coefficients with modulus $\ge 2$ ensure convergence, and previous works (e.g., Katok and Ugarcovici) have identified specific exclusion sets, the objective here is to classify all minimal exclusion sets of length two and to construct infinite exclusion sets that are strictly stronger than any finite set.

Methodology
The authors employ a combination of combinatorial, geometric, and analytic techniques:

1. Farey Graph Correspondence: The paper utilizes the correspondence between integer continued fractions and paths in the Farey graph. A continued fraction diverges if and only if its corresponding path in the Farey graph contains repeated vertices (convergents).
2. Triangulated Polygons and Quiddity Sequences: Divergent continued fractions are linked to "trimmed quiddity sequences," which correspond to the vertex degrees of rooted triangulated polygons. The authors analyze these polygons using a grafting operation ($*$) on rooted planar binary trees to identify unavoidable substrings.
3. Analytic Nesting Arguments: For Gaussian integers, the authors use a "nesting argument" involving Möbius transformations. They define specific half-planes and discs in the complex plane and analyze the composition of maps $G_e(z) = 1 - 1/(ez)$. By proving that certain compositions map a specific region into itself, they establish convergence criteria.
4. Classification via Periodic Fractions: To prove minimality and incomparability of exclusion sets, the authors construct specific periodic continued fractions (divergent examples) that avoid all but one candidate set, thereby demonstrating that no smaller set can serve as an exclusion set.

Key Contributions and Results

1. Classification of Integer Exclusion Sets (Theorem A)
The authors provide a complete classification of all minimal exclusion sets of length two over the integers.

• Result: There are exactly 18 minimal exclusion sets of length two (9 sets and their reversals).
• Structure: These sets, denoted $O_1$ through $O_9$, consist of specific pairs of integers (e.g., $O_1 = \{(1, 1), (1, 2), (2, 1), (1, 3)\}$).
• Connection: This classification is shown to be equivalent to the classification of minimal unavoidable words of length two in Conway–Coxeter quiddity sequences.

2. Infinite Exclusion Sets (Theorem B)
The paper constructs an infinite exclusion set, denoted $\mathcal{O}$, which consists of all words $(b_0, \dots, b_n)$ such that the continued fraction $[b_0, \dots, b_n] = 0$ and all its convergents are distinct.

• Result: $\mathcal{O}$ is an exclusion set.
• Significance: $\mathcal{O}$ is strictly stronger than any finite exclusion set. That is, the set of convergent fractions excluded by $\mathcal{O}$ is a proper subset of those excluded by any finite exclusion set $O$. This implies that no finite set of local restrictions can fully characterize the convergence of integer continued fractions.

3. Gaussian Integer Exclusion Sets (Theorem D)
The authors classify minimal reversible exclusion sets of length two over Gaussian integers.

• Result: There are exactly two such minimal sets, $U_1$ and $U_2$.
• Structure:
  • $U_1$ is defined by the product of pairs: $\{(a, b) : ab \in \Omega\} \cup \{0\}$, where $\Omega$ is a specific set of Gaussian integers lying inside a cardioid region (excluding $3 \pm 2i$).
  • $U_2$ is similar to $U_1$ but differs in the inclusion of the pair $\{1+i, 2+i\}$ versus $\{1, 1+2i\}$.
• Comparison: These sets are incomparable; $U_1$ excludes some fractions $U_2$ does not, and vice versa. $U_1$ is shown to be a strict improvement over the classical exclusion set derived from the Scott-Wall and Leighton-Thron parabola theorems.

4. Corollaries and Open Problems

• Corollary C: The minimal unavoidable sets of length two for trimmed quiddity sequences are exactly the sets $O_i$ and their reversals.
• Open Questions: The paper notes that the classification of ordered (non-reversible) exclusion sets for Gaussian integers remains open. Additionally, the problem of determining minimal exclusion sets for Eisenstein integers is posed as a future direction.

Significance
The paper claims significance in providing the first complete classification of minimal local convergence criteria for length-two substrings in both integer and Gaussian integer settings. By linking continued fraction convergence to the combinatorics of triangulated polygons (quiddity sequences), the authors bridge number theory and combinatorial geometry. Furthermore, the construction of the infinite exclusion set $\mathcal{O}$ demonstrates a fundamental limitation of finite local criteria, showing that optimal convergence conditions for integer continued fractions inherently require infinite complexity. The results for Gaussian integers refine existing analytic criteria, offering tighter bounds on convergence behavior.