Majorization in odd-digit Kaprekar dynamics and the nine-digit arrival law
Year: 2026
Type: preprint
Abstract: Arrange a string of digits in decreasing and increasing order, subtract, and repeat. For any odd number of digits the continuous large-base map decreases the vector of successive gaps in majorization order. Every real orbit approaches a periodic orbit. For nine digits and strictly positive gaps, periodicity is reached in finite time, with period one or three. For a uniformly chosen nonconstant string, the initial differences, the time to the first cyclic number and the differences of that number, all divided by the base, have five distinct joint limits, indexed by the base modulo five. A uniform linear bound on the arrival time gives convergence of all fixed positive moments and exponential moments. The nine-digit proofs use computer-assisted affine inequalities and exact lattice counts. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24342270), and the code is at github.com/galyavin/kaprekar-dynamics. Prepared with substantial AI assistance under the author's direction and close supervision; the author takes responsibility for the contents. Contact: [email protected]
Author: Galyavin, Rustem
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236623378
