Deterministic Structures in the Stopping Time Dynamics of the 3x+1 Problem
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917300699922432 |
|---|---|
| author | Winkler, Mike |
| author_facet | Winkler, Mike |
| contents | The $3x+1$ problem concerns the iteration of the map $T:\mathbb{Z}\to\mathbb{Z}$ defined by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. We study the \emph{coefficient stopping time} dynamics of $T$ (in the sense of Terras) by relating parity vectors of Collatz trajectories to exponential Diophantine equations. We construct a recursively generated tree of congruence classes $\bmod\,2^{σ_N}$ that characterizes the sets of integers with equal coefficient stopping time $σ^\ast(x)=σ_N$. We show that these classes satisfy a deterministic recursion and derive arithmetic transition rules between neighboring congruence classes based on differences of the associated Diophantine sums. Finally, we prove that the union of coefficient stopping time congruence classes generated up to a fixed order $N$ is periodic and establish a computable finite-range coverage bound. These results do not resolve the $3x+1$ conjecture, since it remains unproved that the coefficient stopping time coincides with the classical stopping time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1709_03385 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Deterministic Structures in the Stopping Time Dynamics of the 3x+1 Problem Winkler, Mike General Mathematics 11B37, 11B83 (Primary) 11D61, 03D20 (Secondary) The $3x+1$ problem concerns the iteration of the map $T:\mathbb{Z}\to\mathbb{Z}$ defined by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. We study the \emph{coefficient stopping time} dynamics of $T$ (in the sense of Terras) by relating parity vectors of Collatz trajectories to exponential Diophantine equations. We construct a recursively generated tree of congruence classes $\bmod\,2^{σ_N}$ that characterizes the sets of integers with equal coefficient stopping time $σ^\ast(x)=σ_N$. We show that these classes satisfy a deterministic recursion and derive arithmetic transition rules between neighboring congruence classes based on differences of the associated Diophantine sums. Finally, we prove that the union of coefficient stopping time congruence classes generated up to a fixed order $N$ is periodic and establish a computable finite-range coverage bound. These results do not resolve the $3x+1$ conjecture, since it remains unproved that the coefficient stopping time coincides with the classical stopping time. |
| title | Deterministic Structures in the Stopping Time Dynamics of the 3x+1 Problem |
| topic | General Mathematics 11B37, 11B83 (Primary) 11D61, 03D20 (Secondary) |
| url | https://arxiv.org/abs/1709.03385 |