Algorithms for a class of infinite permutation groups

被引:3
|
作者
Kohl, Stefan [1 ]
机构
[1] Univ Stuttgart, Inst Geometrie & Topol, D-70550 Stuttgart, Germany
关键词
computational group theory; infinite permutation group; residue-class-wise affine group; 3n+1 conjecture; Collatz conjecture; GAP system;
D O I
10.1016/j.jsc.2007.12.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer tit such that it is affine on residue classes (mod m). This article describes a collection of algorithms and methods for computation in permutation groups and monoids formed by residue-class-wise affine mappings. (c) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:545 / 581
页数:37
相关论文
共 50 条