Work

The growth of 3x+1 trees: extremal leaf counts and tilted 3-adic Syracuse laws

Year: 2026
Type: preprint
Abstract: For the shortcut Collatz map T(n) = n/2 for even n and T(n) = (3n+1)/2 for odd n, this paper proves that the number of depth-k preimages not divisible by 3 is (4/3)^(k+o(k)), uniformly over integer roots not divisible by 3. This resolves Applegate and Lagarias's extremal tree-counting Conjecture C and implies the corresponding uniform asymptotic for unpruned trees, Conjecture B. It does not prove convergence of Collatz orbits or the stronger bounded-factor tree-counting conjectures. The proof relates tree counts to tilted 3-adic Syracuse laws. At the quarter bias, their cylinder densities coincide with the normalized limiting average leaf counts introduced by Applegate and Lagarias in The distribution of 3x+1 trees (1995, §6). The paper determines their Lq spectrum for every bias and q > 1, and identifies the decay rate of the least cylinder density with a reverse-entropy rate under an explicit cylinder floor. Leen's absolute-continuity theorem at the quarter bias then supplies the lower estimate needed for the tree counts. This initial preprint is circulated for feedback. The archive contains the PDF, complete LaTeX source, two standalone Python verifiers using exact integer and rational arithmetic, reproduction instructions, checksums and expected numerical outputs. These programs check finite inputs and consistency; they do not formally verify the all-depth proofs. The paper was developed iteratively with extensive AI assistance, as detailed in its AI Declaration. The manuscript and original documentation are licensed under CC BY 4.0. The Python code is licensed under MIT; see LICENSE.md in the archive.
Language: English
Open Access status: green
OpenAlex ID: W7234901014
Cites:
Cited by:
Related to: 10