The Collatz problem in F_p [x] and F_p [[x]]
From MaRDI portal
Publication:6136713
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]\)
Cites work
- A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
- A Polynomial Analogue of the 3n + 1 Problem
- Almost all orbits of the Collatz map attain almost bounded values
- 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
- The 3x + 1 Problem and Its Generalizations
- The autoconjugacy of the \(3x+1\) function.
- The ultimate challenge. The \(3x+1\) problem
Cited in
(6)- The finite Littlewood problem in \(\mathbb{F}_p\)
- Bounds for zeros of Collatz polynomials, with necessary and sufficient strictness conditions
- On the stopping time of the Collatz map in \(\mathbb{F}_2 [x]\)
- The Collatz map analogue in polynomial rings and in completions
- On q-analogs of the 3x + 1 dynamical system
- A variant of Collatz's conjecture over binary polynomials
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)