An algorithm for solving the factorization problem in permutation groups

Journal of Symbolic Computation

Volumn 26, Issue 1, 1998, Pages 89-95

  Minkwitz, Torsten ^a  

^a DEUTSCHE TELEKOM LABORATORIES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032119334     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1998.0202     Document Type: Article

References (7)

1. Atkinson, M.D. (Ed) (1984). Computational Group Theory. Academic Press.
2. Butler, G. (1991). Fundamental Algorithms for Permutation Groups. Springer-Verlag: LNCS 559.
3. Cannon, J., Bosma, W. (1994). Handbook of Magma Functions. University of Sidney.
4. Hofstadter, D. (1985). Metamagical Themas: Questing for the Essence of Mind and Pattern. Basic Books.
5. Leon, J.S. (1980). On an algorithm for finding a base and a strong generating set for a group given by generating permutations. Math. of Computation, 35, 941-974.
6. Schönert, M. et al. (1992). GAP: Groups, Algorithms and Programming. Lehrstuhl D für Mathematik, RWTH Aachen.
7. Sims, C.C. (1970). Computational methods in the study of permutation groups. In Leech, J., ed., Computational Problems in Abstract Algebra, pp. 169-183. Pergamon.