A variant of Collatz's conjecture over binary polynomials

DOI10.33044/REVUMA.5555MaRDI QIDQ7250404zbMATH OpenFDO

Authors Luis Gallardo, Olivier Rahavandrainy

Publication date 20 May 2026

Published in Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33044/REVUMA.5555

zbMATH Keywords

characteristic 2finite fieldsodd (even) polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Cites work

• A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
• A Polynomial Analogue of the 3n + 1 Problem
• Characterization of sporadic perfect polynomials over \(\mathbb{F}_2\)
• Odd perfect polynomials over \(\mathbb F_2\)
• On Mersenne polynomials over \(\mathbb{F}_2\)
• On the stopping time of the Collatz map in \(\mathbb{F}_2 [x]\)
• The Collatz map analogue in polynomial rings and in completions
• [[:Publication:6136713|The Collatz problem in \(\mathbb{F}_p [x]\) and \(\mathbb{F}_p x\)]]

This page was built for publication: A variant of Collatz's conjecture over binary polynomials

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