Revista de la
Unión Matemática Argentina
A variant of Collatz's conjecture over binary polynomials
Luis H. Gallardo and Olivier Rahavandrainy

Volume 69, no. 1 (2026), pp. 295–302    

Published online (final version): March 3, 2026

https://doi.org/10.33044/revuma.5555

Download PDF

Abstract

We study a natural analogue of Collatz's conjecture for polynomials over $\mathbb{F}_2$.

References

  1. G. Alon, A. Behajaina, and E. Paran, On the stopping time of the Collatz map in $\mathbb{F}_2[x]$, Finite Fields Appl. 99 (2024), Paper No. 102473.  DOI  MR  Zbl
  2. A. Behajaina and E. Paran, The Collatz problem in $\mathbb{F}_p[x]$ and $\mathbb{F}_p[[x]]$, Finite Fields Appl. 91 (2023), Paper No. 102265.  DOI  MR  Zbl
  3. A. Behajaina and E. Paran, The Collatz map analogue in polynomial rings and in completions, Discrete Math. 348 no. 1 (2025), Paper No. 114273.  DOI  MR  Zbl
  4. L. H. Gallardo and O. Rahavandrainy, Odd perfect polynomials over $\mathbb{F}_2$, J. Théor. Nombres Bordeaux 19 no. 1 (2007), 165–174.  DOI  MR  Zbl
  5. L. H. Gallardo and O. Rahavandrainy, Characterization of sporadic perfect polynomials over $\mathbb{F}_2$, Funct. Approx. Comment. Math. 55 no. 1 (2016), 7–21.  DOI  MR  Zbl
  6. L. H. Gallardo and O. Rahavandrainy, On Mersenne polynomials over $\mathbb{F}_2$, Finite Fields Appl. 59 (2019), 284–296.  DOI  MR  Zbl
  7. K. Hicks, G. L. Mullen, J. L. Yucas, and R. Zavislak, A polynomial analogue of the $3n+1$ problem, Amer. Math. Monthly 115 no. 7 (2008), 615–622.  DOI  MR  Zbl
  8. K. R. Matthews and G. M. Leigh, A generalization of the Syracuse algorithm in $F_q[x]$, J. Number Theory 25 no. 3 (1987), 274–278.  DOI  MR  Zbl
  9. Wikipedia contributors, Collatz conjecture — Wikipedia, the free encyclopedia. Available at https://en.wikipedia.org/wiki/Collatz_conjecture.