Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 22 tok/s Pro
GPT-4o 93 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 426 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

p-Cantor Sequence: Automaticity & Fractal Geometry

Updated 23 October 2025
  • p-Cantor sequence is a p-automatic infinite word generated by a uniform p-morphism, exhibiting self-similarity and fractal structure.
  • Its associated Toeplitz determinants form a bi-dimensional number wall with [p,p]-automatic patterning and square window clustering of zeros.
  • The sequence provides counterexamples to the KPS conjecture through partial escape of mass, offering valuable insights into arithmetic geometry over finite fields.

A pp-Cantor sequence is a generalization of the classical Cantor sequence constructed over a prime field Fp\mathbb{F}_p, with deep connections to automatic sequences, self-similar fractal geometry, Toeplitz determinants, and Diophantine phenomena in function fields. For each odd prime pp, the pp-Cantor sequence is defined as the unique fixed point of a uniform pp-morphism acting on the digit alphabet {0,1,,p1}\{0,1,\ldots,p-1\}, which produces a pp-automatic, self-similar infinite word. The structure of its associated Toeplitz determinants in Fp\mathbb{F}_p—arranged as a two-dimensional "number wall"—exhibits fractal properties and [p,p]-automaticity, allowing for rigorous analysis of arithmetic and geometric phenomena, such as escape of mass in Laurent series, in characteristic pp.

1. Definition and Generation of the pp-Cantor Sequence

The pp-Cantor sequence, denoted C(p)C^{(p)}, is specified by a substitution (uniform pp-morphism) φp\varphi_p: φp(n)i=n(p2i/2)modpfor even i,φp(n)i=0 otherwise\varphi_p(n)_i = n \cdot \binom{p_2}{i/2} \mod p \quad \text{for even } i, \quad \varphi_p(n)_i = 0 \text{ otherwise} where p2=(p1)/2p_2 = (p-1)/2 and n{0,1,,p1}n \in \{0,1,\ldots,p-1\}.

Its fixed point is constructed as: C(p)=limkφpk(1)C^{(p)} = \lim_{k \to \infty}\varphi_p^k(1) This sequence is pp-automatic and reflects the self-similarity property: at every scale, one can decompose the word of length pkp^k into pp blocks, each generated via combinatorial coefficients. A symmetry property holds: ci(p)=cpk1i(p)for all i,kc^{(p)}_i = c^{(p)}_{p^k-1-i} \quad \text{for all } i, k emphasizing its palindromic and fractal features.

2. Toeplitz Determinants and the Number Wall

For any doubly-infinite sequence SS, including C(p)C^{(p)}, the pp-number wall is the bi-infinite array Wp(S)W_p(S) given by Toeplitz determinants: Wp(S)[m,n]={det(TS(n;m)),m0 1,m=1 0,m<1 W_p(S)[m,n] = \begin{cases} \det(T_S(n; m)), & m \geq 0 \ 1, & m = -1 \ 0, & m < -1 \ \end{cases} where TS(n;m)T_S(n; m) is the (m+1)×(m+1)(m+1)\times(m+1) Toeplitz matrix with entries from SS. A fundamental result, the Square Window Theorem, shows that zeros in Wp(S)W_p(S) cluster in square blocks ("windows") surrounded by frames of nonzero elements.

The profile χ(Wp(C(p)))\chi(W_p(C^{(p)}))—which marks zeros and nonzeros—is shown to be [p,p][p,p]-automatic: it is generated by a two-dimensional uniform substitution on an alphabet of $12$ letters, followed by a coding that maps nonzero entries to a fixed symbol (e.g., XX).

3. Fractal Structure from Toeplitz Determinants

By interpreting the number wall as a geometric object, the profile induces a self-similar fractal in [0,1]2[0,1]^2 via a covering construction: for each rr, subdivide the square into pr×prp^r \times p^r grids, including those corresponding to nonzero entries. The limiting set

Af(C(p),Fp)=r=1Jr\mathcal{A}_f(C^{(p)},\mathbb{F}_p) = \bigcap_{r=1}^{\infty}\mathcal{J}_r

is shown to have a precise Hausdorff dimension: dimH(Af(C(p),Fp))=log((p2+1)/2)log(p)\dim_H(\mathcal{A}_f(C^{(p)},\mathbb{F}_p)) = \frac{\log((p^2+1)/2)}{\log(p)} This demonstrates a direct link between the combinatorial construction of C(p)C^{(p)}, the algebraic properties of Toeplitz determinants, and the emergent fractal geometry.

4. Escape of Mass and Counterexamples to the KPS Conjecture

Kemarsky, Paulin, and Shapira conjectured that any Laurent series over Fp\mathbb{F}_p would exhibit full escape of mass with respect to irreducible polynomials P(t)P(t), meaning the limiting measure associated to partial quotients vanishes almost everywhere along certain dynamical progressions. The pp-Cantor sequence, via its Laurent series Θp(t)=t1ici(p)ti\Theta_p(t)=t^{-1}\sum_i c^{(p)}_i t^{-i}, provides an explicit counterexample for odd pp (Aranov et al., 22 Oct 2025): the escape of mass is exactly $2/p$ (on appropriate subsequences of diagonals), not $1$.

The proof leverages the structure of the number wall—zeros correspond to large partial quotients in continued fraction expansions—showing that only partial escape of mass occurs (not full), but maximal and generic escape variants do hold under appropriate versions.

5. Automaticity and Self-Similarity

The pp-Cantor sequence is pp-automatic, meaning its elements are computed by a finite automaton reading the pp-ary expansions of indices. This automaticity extends to its Hankel and Toeplitz determinants, facilitating deep arithmetic and analytic analysis. The self-similarity, both in its construction and its induced fractals, reflects the recursive combinatorial operations underlying the sequence.

6. Mathematical Significance and Broader Applications

These developments unify concepts from recursion theory, finite automata, combinatorics on words, harmonic analysis, and fractal geometry. The explicit description of the number wall tiling, automaticity in two dimensions, and computation of fractal dimension provide new tools for analyzing Diophantine approximation in positive characteristic, the distribution of continued fraction expansions, and problems in symbolic dynamics.

The pp-Cantor sequence's properties—automaticity, fractal emergence, and arithmetic rigidity—make it a canonical test object for further investigations into the interaction between automata-theoretic constructions and arithmetic geometry over finite fields, as well as for exploring the structure of counterexamples to conjectures in escape of mass phenomena (Robertson et al., 22 Oct 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)
Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to $p$-Cantor Sequence.