The Collatz problem in \(\mathbb{F}_p [x]\) and \(\mathbb{F}_p [[x]]\)
From MaRDI portal
Publication:6136713
DOI10.1016/j.ffa.2023.102265zbMath1526.37092MaRDI QIDQ6136713
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Special sequences and polynomials (11B83) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05) Arithmetic properties of periodic points (37P35)
Cites Work
- Unnamed Item
- The autoconjugacy of the \(3x+1\) function.
- A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x\)]
- The 3x + 1 Problem and Its Generalizations
- Analogues of the 3x+ 1 Problem in Polynomial Rings of Characteristic 2
- Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding
- A Polynomial Analogue of the 3n + 1 Problem
- Almost all orbits of the Collatz map attain almost bounded values