Algorithms for a class of infinite permutation groups.

DOI10.1016/j.jsc.2007.12.001zbMath1155.20003OpenAlexW2012908484MaRDI QIDQ928769

Stefan Kohl

Publication date: 11 June 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.12.001

zbMATH Keywords

infinite permutation groupsCollatz problemGAPcomputational group theoryCollatz conjecture\(3n+1\) problem\(3n+1\) conjectureresidue-class-wide affine mappingsresidue-class-wise affine groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Special sequences and polynomials (11B83)

Related Items

The Collatz conjecture in a group theoretic context ⋮ Practical graph isomorphism. II. ⋮ A simple group generated by involutions interchanging residue classes of the integers. ⋮ RCWA

Uses Software

• GAP
• Polycyclic

Cites Work

• Unnamed Item
• Unnamed Item
• The dynamical system generated by the \(3n+1\) function
• Wildness of iteration of certain residue-class-wise affine mappings
• Finite cycles of certain periodically linear permutations