Algorithms for a class of infinite permutation groups. (Q928769): Difference between revisions

Motivated by the \(3n+1\) ``Collatz'' problem [see the survey by \textit{G. J. Wirsching}, Elem. Math. 55, No. 4, 142-155 (2000; Zbl 0999.11013)], the author studies groups of permutations defined on the integers such that for a chosen \(n\) they are affine functions on the residue classes modulo \(n\). (The author calls these `residue-class wise affine' groups, short RCWA.) The underlying mathematics has been studied by the author before [in Adv. Appl. Math. 39, No. 3, 322-328 (2007; Zbl 1146.11015)].) The paper under review describes basic algorithms (such as: element arithmetic, direct product, wreath product, transitivity tests) for working with such groups, as implemented in his \texttt{GAP} package \texttt{RCWA}. Methods for element order or group membership only are provided for particular well-behaved cases. (The general problem is known to be not algorithmically solvable.)