Structural Invariants and Segmented Block Dynamics of a Self-Avoiding $3n+1$ Stepping-Stone Walk

We study a deterministic self-avoiding variant of the Collatz dynamical system on $\mathbb{Z}^+$, modeled as a stepping-stone walk starting at $a(1)=1$. At each step, the walk takes the standard Collatz transition ($n/2$ for even $n$, $3n+1$ for odd $n$) whenever the target integer is unvisited, and applies a universal tripling fallback ($3n$) whenever the primary target has already been visited. We prove unconditionally that the walk is infinite, visits no integer twice, and generates strictly non-repetitive signed step widths $\Delta a(t)=a(t+1)-a(t)$ across all turns, with no positive step width congruent to $1 \pmod 4$. Viewing prefix completion across blocks $B_K=[100(K-1)+1,100K]$ as a stateful segmented sieve, we establish exact forward-marking conservation laws, unconditional residue eliminations for minimal missed stones, a canonical de-tripling Euclid descent operator, an unconditional dyadic escalator capture bound, and a logarithmic drift identity linking subexponential trajectory growth to the critical halving density $\ln 3 / \ln 6 \approx 61.315\%$. We conclude by separating unconditional and conditional theorems from open surjectivity and cover-time scaling problems.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24341974
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Structural Invariants and Segmented Block Dynamics of a Self-Avoiding $3n+1$ Stepping-Stone Walk

C. Tantisukarom
1 links
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
preprint

Structural Invariants and Segmented Block Dynamics of a Self-Avoiding $3n+1$ Stepping-Stone Walk

C. Tantisukarom
preprint en

Abstract

We study a deterministic self-avoiding variant of the Collatz dynamical system on $\mathbb{Z}^+$, modeled as a stepping-stone walk starting at $a(1)=1$. At each step, the walk takes the standard Collatz transition ($n/2$ for even $n$, $3n+1$ for odd $n$) whenever the target integer is unvisited, and applies a universal tripling fallback ($3n$) whenever the primary target has already been visited. We prove unconditionally that the walk is infinite, visits no integer twice, and generates strictly non-repetitive signed step widths $\Delta a(t)=a(t+1)-a(t)$ across all turns, with no positive step width congruent to $1 \pmod 4$. Viewing prefix completion across blocks $B_K=[100(K-1)+1,100K]$ as a stateful segmented sieve, we establish exact forward-marking conservation laws, unconditional residue eliminations for minimal missed stones, a canonical de-tripling Euclid descent operator, an unconditional dyadic escalator capture bound, and a logarithmic drift identity linking subexponential trajectory growth to the critical halving density $\ln 3 / \ln 6 \approx 61.315\%$. We conclude by separating unconditional and conditional theorems from open surjectivity and cover-time scaling problems.

Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon