A Multiplicative Analogue of the Slater--V\'elez Permutation

Motivated by the difference-restricted integer permutation of Slater and V\'elez (1977), its recent resolution by Floros (2026), and collision-avoiding integer walks such as Recam\'an's sequence, we introduce and analyze a history-dependent arithmetic dynamical system on $\mathbb{N}$, termed the \emph{Modified Collatz Maze}. Starting at $x_0 = 1$, the walk applies the classical Collatz transitions ($x \mapsto 3x+1$ for odd $x$, and $x \mapsto x/2$ for even $x$) whenever the halving target $x/2$ is unvisited, and detours upward via $x \mapsto 3x$ whenever $x/2$ has already been visited. We prove unconditionally that visit multiplicities satisfy $\mu(m) \le 1$ for $m \equiv 1, 2, 3, 5 \pmod 6$, $\mu(m) \le 2$ for $m \equiv 4, 6, 10, 12, 16 \pmod{18}$ (covering $17/18$ of $\mathbb{N}$), and $\mu(m) \le v_3(m) + 1$ for all $m \equiv 0 \pmod 6$. Consequently, the trajectory is unconditionally free of periodic cycles and satisfies $\lim_{k\to\infty} x_k = +\infty$. Next, we prove that the omitted set $\mathbb{N} \setminus V_\infty$ is backwards-invariant under the classical Collatz map $T$, forcing power-law exclusions ($\gg_m X^\eta$ omitted integers below $X$) around any omitted $m \not\equiv 0 \pmod 3$, eliminating $7$ of the $12$ residue classes modulo $12$ for $\min(\mathbb{N} \setminus V_\infty)$, and eliminating $M \equiv 8 \pmod 9$ and $M \equiv 20 \pmod{27}$ for $M = \min(\mathcal{C}_2 \setminus V_\infty)$. Contrasting Floros's two-map first-moment summation with the multiplicative structure here, we prove that covered prefixes $[1, X] \subseteq V_\infty$ are absorbing-complement sets (never re-entered once exited) and obey an exact upward-entry conservation law, yielding the unconditional bound $A(X) < \frac{3}{5}X + \frac{4}{3}\log_6 X + 2$ on the first-passage ascent count $A(X)$ and coupling detour density to revisit density. Finally, an exact logarithmic telescoping identity proves $\frac{N_{\mathrm{half}}(k)}{k} = \frac{\ln 3}{\ln 6} - \frac{\ln x_k}{k\ln 6} + O\!\left(\frac{\log k}{k}\right)$, explaining why $10^7$-step simulations match the zero-drift constants $\ln 3/\ln 6$, $\ln 3/(2\ln 6)$, and $(2\ln 2 - \ln 3)/(2\ln 6)$ to five decimal places for halving and four decimal places for upward branches.

Authors

Publication Details

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

A Multiplicative Analogue of the Slater--V\'elez Permutation

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

A Multiplicative Analogue of the Slater--V\'elez Permutation

C. Tantisukarom
preprint en

Abstract

Motivated by the difference-restricted integer permutation of Slater and V\'elez (1977), its recent resolution by Floros (2026), and collision-avoiding integer walks such as Recam\'an's sequence, we introduce and analyze a history-dependent arithmetic dynamical system on $\mathbb{N}$, termed the \emph{Modified Collatz Maze}. Starting at $x_0 = 1$, the walk applies the classical Collatz transitions ($x \mapsto 3x+1$ for odd $x$, and $x \mapsto x/2$ for even $x$) whenever the halving target $x/2$ is unvisited, and detours upward via $x \mapsto 3x$ whenever $x/2$ has already been visited. We prove unconditionally that visit multiplicities satisfy $\mu(m) \le 1$ for $m \equiv 1, 2, 3, 5 \pmod 6$, $\mu(m) \le 2$ for $m \equiv 4, 6, 10, 12, 16 \pmod{18}$ (covering $17/18$ of $\mathbb{N}$), and $\mu(m) \le v_3(m) + 1$ for all $m \equiv 0 \pmod 6$. Consequently, the trajectory is unconditionally free of periodic cycles and satisfies $\lim_{k\to\infty} x_k = +\infty$. Next, we prove that the omitted set $\mathbb{N} \setminus V_\infty$ is backwards-invariant under the classical Collatz map $T$, forcing power-law exclusions ($\gg_m X^\eta$ omitted integers below $X$) around any omitted $m \not\equiv 0 \pmod 3$, eliminating $7$ of the $12$ residue classes modulo $12$ for $\min(\mathbb{N} \setminus V_\infty)$, and eliminating $M \equiv 8 \pmod 9$ and $M \equiv 20 \pmod{27}$ for $M = \min(\mathcal{C}_2 \setminus V_\infty)$. Contrasting Floros's two-map first-moment summation with the multiplicative structure here, we prove that covered prefixes $[1, X] \subseteq V_\infty$ are absorbing-complement sets (never re-entered once exited) and obey an exact upward-entry conservation law, yielding the unconditional bound $A(X) < \frac{3}{5}X + \frac{4}{3}\log_6 X + 2$ on the first-passage ascent count $A(X)$ and coupling detour density to revisit density. Finally, an exact logarithmic telescoping identity proves $\frac{N_{\mathrm{half}}(k)}{k} = \frac{\ln 3}{\ln 6} - \frac{\ln x_k}{k\ln 6} + O\!\left(\frac{\log k}{k}\right)$, explaining why $10^7$-step simulations match the zero-drift constants $\ln 3/\ln 6$, $\ln 3/(2\ln 6)$, and $(2\ln 2 - \ln 3)/(2\ln 6)$ to five decimal places for halving and four decimal places for upward branches.

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
A Multiplicative Analogue of the Slater--V\'elez Permutation — C. Tantisukarom · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS