English

A Coordinate System for Collatz Dynamics

Number Theory 2026-07-02 v1

Abstract

It is well-established that every odd positive integer nn can be written uniquely as n=λ2a3b1n = \lambda \cdot 2^a \cdot 3^b - 1 where gcd(λ,6)=1\gcd(\lambda, 6) = 1 and a1a \geq 1. Building from this 3-smooth factorization, we introduce a partition of the nonnegative integers into countably many infinite triangles where each row kk forms a Collatz chain of alternating parity. The partition admits a coordinate system as a skeleton Lλ\mathcal{L}_\lambda using the pair (a,b)(a, b) for odd positive integers within a geometric structure where row kk corresponds to k=a+bk = a + b. Each position (a,b)(a, b) maps to (a1,b+1)(a-1, b+1), a deterministic diagonal flow requiring no number-theoretic input. At the boundary a=1a = 1, the trajectory exits to another skeleton depending on the factorization of λ3b+11\lambda \cdot 3^{b+1} - 1. The coordinate system is new. As a concrete application, we prove that rows k2(mod4)k \equiv 2 \pmod 4 with k6k \geq 6 in the principal skeleton L1\mathcal{L}_1 contain no primes, and show this is the unique residue class admitting complete algebraic obstruction. Our contribution is the framework that makes visible which nonnegative integers these arguments apply to, with all results independent of the Collatz conjecture.

Cite

@article{arxiv.2607.01718,
  title  = {A Coordinate System for Collatz Dynamics},
  author = {Jennifer Williams},
  journal= {arXiv preprint arXiv:2607.01718},
  year   = {2026}
}

Comments

21 pages, 5 figures, under peer review