A generalization of the Syracuse algorithm in F_ q[x]

DOI10.1016/0022-314X(87)90032-1MaRDI QIDQ1821137zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1987

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-314x(87)90032-1

zbMATH Keywords

divergent trajectoriesfinite fieldsring of polynomialsSyracuse algorithmSyracuse-Kakutani-Collatz problem

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Review text

The Syracuse algorithm on the natural numbers is defined by \(T(2n)=n\) and \(T(2n+1)=3n+2\). The Syracuse-Kakutani-Collatz problem is to determine whether successive iterates of T for a given n ultimately terminate (at the value 1) or become cyclic [see, for example, \textit{J. C. Lagarias}, Am. Math. Mon. 92, 3-23 (1985; Zbl 0566.10007)]. The authors consider the following extension of the mapping, T, of \({\mathbb{F}}_ q[x]\) onto itself, the ring of polynomials over a field F of q elements: \(T(f)=(m_ if-r_ i)/d\), if \(f=x_ i\) (mod d), where d belongs to \({\mathbb{F}}_ q[x]\), \(t=\deg d\), \(N(d)=q^{\deg d}\), \(R=\{x_ 1,x_ 2,...,x_{N(d)}\}\) is the complete set of residues mod d, \(m_ i\) in \({\mathbb{F}}_ q[x]\) such that \(\gcd (m_ i,d)=1\) and \(r_ i\) in R are congruent to \(m_ ix_ i\) mod d. The authors present two mappings T and corresponding polynomials which have divergent trajectories, in the sense that \[ \lim_{N\to \infty}card\{K\leq N | \quad T^ K(f)=j\quad (mod d)\}/N \] does not exist.

Recommendations

• A Markov process underlying the generalized Syracuse algorithm
• A Polynomial Analogue of the 3n + 1 Problem
• Analogues of the 3x+1 problem in polynomial rings of characteristic 2
• Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+ 1 Problem)
• The 3x + 1 Problem and Its Generalizations

Cites work

• A generalization of Hasse's generalization of the Syracuse algorithm

Cited in

(7)

• A Markov process underlying the generalized Syracuse algorithm
• On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture
• Analogues of the 3x+1 problem in polynomial rings of characteristic 2
• A Polynomial Analogue of the 3n + 1 Problem
• [[:Publication:6136713|The Collatz problem in \(\mathbb{F}_p [x]\) and \(\mathbb{F}_p x\)]]
• The Collatz map analogue in polynomial rings and in completions
• A variant of Collatz's conjecture over binary polynomials

This page was built for publication: A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821137)