On the stopping time of the Collatz map in mathbb{F}₂[x]
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PVW3A3ZRrecord.jsonopen to challenge →
classification
math.CO
math.NT
keywords
collatzstoppingboundmathbbsequencestimearithmeticcertain
read the original abstract
We study the stopping time of the Collatz map for a polynomial $f \in \mathbb{F}_2[x]$, and bound it by $O({\rm deg} (f)^{1.5})$, improving upon the quadratic bound proven by Hicks, Mullen, Yucas and Zavislak. We also prove the existence arithmetic sequences of unbounded length in the stopping times of certain sequences of polynomials, a phenomenon observed in the classical Collatz map.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.