The Collatz problem in F_p [x] and F_p [[x]]
From MaRDI portal
Publication:6136713
DOI10.1016/J.FFA.2023.102265zbMATH Open1526.37092MaRDI QIDQ6136713FDOQ6136713
Authors: Angelot Behajaina, Elad Paran
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Recommendations
- The Collatz map analogue in polynomial rings and in completions
- The Collatz problem and analogues
- Analogues of the \(3x+1\) problem in polynomial rings of characteristic 2
- On the stopping time of the Collatz map in \(\mathbb{F}_2 [x]\)
- A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
Special sequences and polynomials (11B83) Arithmetic properties of periodic points (37P35) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05)
Cites Work
- The ultimate challenge. The \(3x+1\) problem
- The 3x + 1 Problem and Its Generalizations
- A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
- The autoconjugacy of the \(3x+1\) function.
- A Polynomial Analogue of the 3n + 1 Problem
- Analogues of the \(3x+1\) problem in polynomial rings of characteristic 2
- Almost all orbits of the Collatz map attain almost bounded values
- Parity sequences of the \(3x+1\) map on the 2-adic integers and Euclidean embedding
Cited In (4)
This page was built for publication: The Collatz problem in \(\mathbb{F}_p [x]\) and \(\mathbb{F}_p x\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136713)