The minimal base size of primitive solvable permutation groups

Journal of the London Mathematical Society

Volumn 53, Issue 2, 1996, Pages 243-255

  Seress, Ákos ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001013466     PISSN: 00246107     EISSN: None     Source Type: Journal    
DOI: 10.1112/jlms/53.2.243     Document Type: Article

References (21)

1. L. BABAI, G. COOPERMAN, L. FINKELSTEIN and Á. SERESS, 'Nearly linear time algorithms for permutation groups with a small base', Proc. ISSAC '91, Bonn (1991) 200-209.
2. R. BEALS, 'Computing blocks of imprimitivity for small-base groups in nearly linear time', Groups and computation, DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 11 (ed. L. Finkelstein and W. Kantor, Amer. Math. Soc., Providence, RI, 1993) 17-26.
3. R. BEALS and Á. SERESS, 'Structure forest and composition factors for small base groups in nearly linear time', Proc. 24th ACM STOC (1992) 116-125.
4. K. BLAHA, 'Minimum bases for permutation groups: the greedy approximation', J. Algorithms 13 (1992) 297-306.
5. A. ESPUELAS, 'Large character degrees of groups of odd order', Illinois J. Math. 35 (1991) 499-505.
6. D. GLUCK, 'Trivial set-stabilizers in finite permutation groups', Canad. J. Math. 35 (1983) 59-67.
7. D. GLUCK and O. MANZ, 'Prime factors of character degrees of solvable groups', Bull. London Math. Soc. 19 (1987) 431-437.
8. D. GORENSTEIN, Finite groups (Harper & Row, New York, 1968).
9. M. W. LIEBECK, 'On minimal degrees and base sizes of primitive permutation groups', Arch. Math. 43 (1984) 11-15.
10. E. LUKS and Á. SERESS, 'Computing the Fitting subgroup and solvable radical of small-base permutation groups in nearly linear time', Groups and computation II, DIMACS Ser. Discrete Math. Theoret. Comp. Sci. (ed. L. Finkelstein and W. Kantor, Amer. Math. Soc., Providence, RI), to appear.
11. P. P. PÁLFY, 'A polynomial bound for the orders of primitive solvable groups', J. Algebra 77 (1982) 127-137.
12. P. P. PÁLFY, 'Bounds for linear groups of odd order', Proc. Second Internat. Group Theory Conf., Bressanone/Brixen 1989, Suppl. Rend. Circ. Mat. Palermo 23 (1990) 253-263.
13. C. E. PRAEGER and J. SAXL, 'Closures of finite primitive permutation groups', Bull. London Math. Soc. 24 (1992) 251-258.
14. L. PYBER, 'Asymptotic results for permutation groups', Groups and computation, DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 11 (ed. L. Finkelstein and W. Kantor, Amer. Math. Soc., Providence, RI, 1993) 197-219.
15. M. SCHÖNERT et al. 'GAP: Groups, Algorithms, and Programming', Lehrstuhl D für Mathematik, RWTH Aachen (1992).
16. M. SCHÖNERT and Á. SERESS, 'Finding blocks of imprimitivity in small-base groups in nearly linear time', Proc. ISSAC '94, Oxford (1994) 154-157.
17. Á. SERESS, 'Nearly linear time algorithms for permutation groups: an interplay between theory and practice', Acta Appl. Math., to appear.
18. C. C. SIMS, 'Computation with permutation groups', Proc. Second Sympos. on Symbolic and Algebraic Manipulation (ed. S. R. Petrick, ACM, 1971).
19. D. A. SUPRUNENKO, Matrix groups (Amer. Math. Soc., Providence, RI, 1976).
20. H. W. WIELANDT, 'Permutation groups through invariant relations and invariant functions', Lecture Notes, The Ohio State University (1969).
21. m), Canad. J. Math. 34 (1982) 1097-1111.