[And00] Andaloro, P., On Total Stopping Times under 3x+1 Iteration, Fibonacci Quarterly, 38 (2000), 73-78.
[Bar10] Bartholdi, L.,
FR -- Computations with functionally recursive groups. Version 1.1.3
(2010)
(
GAP package, http://www.gap-system.org/Packages/fr.html
).
[dlH00] de la Harpe, P., Topics in Geometric Group Theory, Chicago Lectures in Mathematics (2000).
[EN09] Eick, B. and Nickel, W.,
Polycyclic -- Computation with polycyclic groups; Version 2.6
(2009)
(
GAP package, http://www.gap-system.org/Packages/polycyclic.html
).
[GT02] Gluck, D. and Taylor, B. D., A New Statistic for the 3x+1 Problem, Proc. Amer. Math. Soc., 130 (5) (2002), 1293-1301.
[Gri80] Grigorchuk, R. I., Burnside's Problem on Periodic Groups, Functional Anal. Appl., 14 (1980), 41-43.
[Hig74] Higman, G., Finitely Presented Infinite Simple Groups, Department of Pure Mathematics, Australian National University, Canberra, Notes on Pure Mathematics (1974).
[HEO05] Holt, D. F., Eick, B. and O'Brien, E. A., Handbook of Computational Group Theory, Chapman & Hall / CRC, Boca Raton, FL, Discrete Mathematics and its Applications (Boca Raton) (2005), xvi+514 pages.
[Kel99] Keller, T. P., Finite Cycles of Certain Periodically Linear Permutations, Missouri J. Math. Sci., 11 (3) (1999), 152-157.
[Koh05] Kohl, S.,
Restklassenweise affine Gruppen,
Dissertation,
Universität Stuttgart
(2005)
(http://deposit.ddb.de/cgi-bin/dokserv?idn=977164071).
[Koh07a] Kohl, S.,
Graph Theoretical Criteria for the Wildness of Residue-Class-Wise Affine Permutations
(2007)
(
Preprint (short note),
http://www.gap-system.org/DevelopersPages/StefanKohl/preprints/graphcrit.pdf
).
[Koh07b] Kohl, S.,
Wildness of Iteration of Certain Residue-Class-Wise Affine Mappings
,
Adv. in Appl. Math.,
39 (3)
(2007),
322-328
(DOI: 10.1016/j.aam.2006.08.003).
[Koh08a] Kohl, S.,
Algorithms for a Class of Infinite Permutation Groups
,
Journal of Symbolic Computation,
43 (8)
(2008),
545-581
(DOI: 10.1016/j.jsc.2007.12.001).
[Koh08b] Kohl, S.,
Simple Groups Generated by Involutions Interchanging
Residue Classes Modulo Lattices in Z^d
(2008)
(
Preprint,
http://www.gap-system.org/DevelopersPages/StefanKohl/preprints/ctzd.pdf
).
[Koh10] Kohl, S.,
A Simple Group Generated by Involutions Interchanging Residue Classes
of the Integers
,
Math. Z.,
264 (4)
(2010),
927-938
(DOI: 10.1007/s00209-009-0497-8).
[Lag06] Lagarias, J. C.,
3x+1 Problem Annotated Bibliography
(2006)
(http://arxiv.org/abs/math.NT/0309224).
[LN11] Lübeck, F. and Neunhöffer, M.,
GAPDoc (Version 1.3),
RWTH Aachen
(2011)
(
GAP package, http://www.gap-system.org/Packages/gapdoc.html
).
[ML87] Matthews, K. R. and Leigh, G. M., A Generalization of the Syracuse Algorithm in GF(q)[x] , J. Number Theory, 25 (1987), 274-278.
[Mih58] Mihailova, K. A., The Occurence Problem for Direct Products of Groups, Dokl. Acad. Nauk. SSSR, 119 (1958), 1103-1105.
[Soi06] Soicher, L.,
GRAPE -- GRaph Algorithms using PErmutation groups (Version 4.3),
Queen Mary, University of London
(2006)
(
GAP package, http://www.gap-system.org/Packages/grape.html
).
generated by GAPDoc2HTML