Polynomial-time isomorphism test for groups with no abelian normal subgroups (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 51-62

  Babai, László ^a   Codenotti, Paolo ^b   Qiao, Youming ^c  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

Code Equivalence; Group Isomorphism; Permutational Isomorphism

Indexed keywords

CODE EQUIVALENCE; EQUIVALENCE PROBLEM; EXTENDED ABSTRACTS; GROUP ISOMORPHISM; PERMUTATION GROUP; PERMUTATIONAL ISOMORPHISM; POLYNOMIAL-TIME; TIME COMPLEXITY;

ALGORITHMS; AUTOMATA THEORY; EQUIVALENCE CLASSES; POLYNOMIALS;

SET THEORY;

EID: 84883800123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_5     Document Type: Conference Paper

References (23)

1. Aschbacher, M., Guralnick, R.: Some applications of the first cohomology group. J. Algebra 90(2), 446-460 (1984)
2. Babai, L., Beals, R.: A polynomial-time theory of black-box groups I. In: Groups St Andrews 1997 in Bath. LMS Lect. Notes, vol. 260, pp. 30-64. Cambr. U. Press (1999)
3. Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.M.: Code equivalence and group isomorphism. In: Proc. 22nd SODA, pp. 1395-1408 (2011)
4. Babai, L., Qiao, Y.M.: Polynomial-time isomorphism test for groups with abelian Sylow towers. In: 29th STACS, pp. 453-464 (2012)
5. Cameron, P.J.: Finite permutation groups and finite simple groups. Bull. London Math. Soc. 13(1), 1-22 (1981)
6. Cannon, J.J., Holt, D.F.: Automorphism group computation and isomorphism testing in finite groups. J. Symb. Comput. 35, 241-267 (2003)
7. Felsch, V., Neubüser, J.: On a programme for the determination of the automorphism group of a finite group. In: Proc. Conf. on Computational Problems in Algebra, Oxford, 1967, pp. 59-60. Pergamon Press (1970)
8. Furst, M.L., Hopcroft, J., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: Proc. 21st FOCS, pp. 36-41. IEEE Comp. Soc. (1980)
9. Kavitha, T.: Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6), 986-996 (2007)
10. Knuth, D.E.: Efficient representation of perm groups. Combinat. 11, 57-68 (1991)
11. Le Gall, F.: Efficient isomorphism testing for a class of group extensions. In: 26th STACS, pp. 625-636 (2009)
12. Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proc. 31st ACM STOC, pp. 652-658. ACM Press (1999)
13. Luks, E.M., Miyazaki, T.: Polynomial-time normalizers for permutation groups with restricted composition factors. In: 13th ISAAC, pp. 176-183 (2002)
14. Luks, E.M., Seress, Á.: Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. In: Workshop on Groups and Computation II, DIMACS Series in DMTCS, pp. 169-181 (1991)
15. log n isomorphism technique. In: 10th STOC, pp. 51-58 (1978)
16. Qiao, Y.M., Sarma, J.M.N., Tang, B.: On isomorphism testing of groups with normal Hall subgroups. In: Proc. 28th STACS, pp. 567-578 (2011)
17. Robinson, D.J.S.: A Course in the Theory of Groups, 2nd edn. Springer (1996)
18. Seress, Á.: Permutation Group Algorithms. Cambridge Univ. Press (2003)
19. Sims, C.C.: Computation with permutation groups. In: Petrick, S.R. (ed.) Proc. 2nd Symp. Symb. Algeb. Manip., pp. 23-28. ACM Press (1971)
20. Steinberg, R.: Generators for simple groups. Canad. J. Math. 14, 277-283 (1962)
21. Suzuki, M.: Group Theory II. Springer (1986)
22. Wilson, J.B.: Decomposing p-groups via Jordan algebras. J. Algebra 322, 2642-2679 (2009)
23. Wilson, J.B.: Finding central decompositions of p-groups. J. Group Theory 12, 813-830 (2009)