Abstract
We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the nlogp n + O(1) generator-enumeration algorithm where n is the order of the group and p is the smallest prime divisor of n. In previous work with Fabian Wagner, we showed an n(1 / 2) logp n + O(log n / log log n) -time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that represent composition series for the groups and applying Luks’ algorithm for testing isomorphism of bounded-degree graphs.
In this work, we extend this improvement to the more general class of solvable groups to obtain an n(1 / 2) logp n + O(log n / log log n) -time algorithm. In the case of solvable groups, the composition factors can be large which prevents previous methods from outperforming the generator-enumeration algorithm. Using Hall’s theory of Sylow bases, we define a new object that generalizes the notion of a composition series with small factors but exists even when the composition factors are large. By constructing graphs that represent these objects and running Luks’ algorithm, we obtain our algorithm for solvable-group isomorphism. We also extend our algorithm to compute canonical forms of solvable groups while retaining the same complexity.
- László Babai, Paolo Codenotti, Joshua A. Grochow, and Youming Qiao. 2011. Code equivalence and group isomorphism. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. 1395--1408.Google Scholar
Cross Ref
- László Babai, Paolo Codenotti, and Youming Qiao. 2012. Polynomial-time isomorphism test for groups with no Abelian normal subgroups (extended abstract). In Proceedings of the 39th International Colloquium on Automata, Languages and Programming. 51--62.Google Scholar
- L. Babai, W. M. Kantor, and E. M. Luks. 1983. Computational complexity and the classification of finite simple groups. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 162--171.Google Scholar
- László Babai and Eugene M. Luks. 1983. Canonical labeling of graphs. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing. 171--183.Google Scholar
- László Babai and Youming Qiao. 2012. Polynomial-time isomorphism test for groups with Abelian Sylow towers. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. 453--464.Google Scholar
- Paulo Codenotti. 2011. Testing Isomorphism of Combinatorial and Algebraic Structures. Ph.D. Dissertation. University of Chicago.Google Scholar
- V. Felsch and J. Neubüser. 1970. On a programme for the determination of the automorphism group of a finite group. In Computational Problems in Abstract Algebra. 59--60.Google Scholar
- C. D. Godsil and B. D. McKay. 1978. A new graph product and its spectrum. Bulletin of the Australian Mathematical Society 18, 1 (1978), 21--28.Google Scholar
Cross Ref
- Joshua Grochow and Youming Qiao. 2014. Algorithms for group isomorphism via group extensions and cohomology. In Proceedings of the 29th IEEE Conference on Computational Complexity. 110--119. arXiv:1309.1776Google Scholar
Digital Library
- Joshua A. Grochow and Youming Qiao. 2015. Polynomial-time isomorphism test of groups that are tame extensions. In Proceedings of the 26th International Symposium on Algorithms and Computation. 578--589. arXiv:1507.01917Google Scholar
- P. Hall. 1938. On the Sylow systems of a soluble group. Proceedings of the London Mathematical Society s2-43, 1 (1938), 316--323.Google Scholar
- W. M. Kantor and D. E. Taylor. 1988. Polynomial-time versions of Sylow’s theorem. Journal of Algorithms 9, 1 (1988), 1--17.Google Scholar
Digital Library
- T. Kavitha. 2007. Linear time algorithms for Abelian group isomorphism and related problems. J. Comput. System Sci. 73, 6 (2007), 986--996.Google Scholar
Digital Library
- François Le Gall. 2009. Efficient isomorphism testing for a class of group extensions. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. 625--636. arXiv:0812.2298Google Scholar
- Mark Lewis and James Wilson. 2012. Isomorphism in expanding families of indistinguishable groups. Groups-Complexity-Cryptology 4, 1 (2012), 73--110.Google Scholar
Cross Ref
- Richard Lipton. 2011. An Annoying Open Problem. Gödel’s Lost Letter and P = NP. https://rjlipton.wordpress.com/2011/10/08/an-annoying-open-problem/.Google Scholar
- R. Lipton, L. Snyder, and Y. Zalcstein. 1977. The Complexity of Word and Isomorphism Problems for Finite Groups. Defense Technical Information Center.Google Scholar
- E. M. Luks. 1982. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci. 25, 1 (1982), 42--65.Google Scholar
Cross Ref
- Gary L. Miller. 1978. On the nlogn isomorphism technique (A preliminary report). In Proceedings of the 10th Annual ACM Symposium on Theory of Computing. 51--58.Google Scholar
- Youming Qiao, Jayalal Sarma, and Bangsheng Tang. 2011. On isomorphism testing of groups with normal Hall subgroups. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science. 567--578.Google Scholar
- D. J. S. Robinson. 1996. A Course in the Theory of Groups. Springer-Verlag.Google Scholar
- David J. Rosenbaum. 2012. Breaking the nlogn barrier for solvable-group isomorphism. (January 2012). arXiv:1205.0642Google Scholar
- David J. Rosenbaum. 2013. Bidirectional collision detection and faster deterministic isomorphism testing. (April 2013). arXiv:1304.3935Submitted to Theoretical Computer Science.Google Scholar
- David J. Rosenbaum. 2013. Breaking the nlogn barrier for solvable-group isomorphism. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. 1054--1073. arXiv:1205.0642Google Scholar
- David J. Rosenbaum and Fabian Wagner. 2015. Beating the generator-enumeration bound for -group isomorphism. Theoretical Computer Science 593 (2015), 16--25. arXiv:1312.1755Google Scholar
Digital Library
- Carla Savage. 1980. An An O(n2) Algorithm for Abelian Group Isomorphism. Computer Studies Program, North Carolina State University.Google Scholar
- Narayan Vikas. 1996. An O(n) algorithm for Abelian -group isomorphism and an O(n2) algorithm for Abelian group isomorphism. J. Comput. System Sci. 53, 1 (1996), 1--9.Google Scholar
Digital Library
- Fabian Wagner. 2011. On the Complexity of Group Isomorphism. Electronic Colloquium on Computational Complexity.Google Scholar
- Fabian Wagner. 2012. On the Complexity of Group Isomorphism. Electronic Colloquium on Computational Complexity. Revision 2.Google Scholar
- Guido Zappa. 1940. Sulla costruzione dei gruppi prodotto di due dati sottogruppi permutabili tra loro. In Atti Secondo Congresso Un. Mat. Ital. Bologna, Vol. 19. 119--125.Google Scholar
Index Terms
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
Recommendations
Beating the generator-enumeration bound for p-group isomorphism
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G H . For several decades, the n log p n + O ( 1 ) generator-enumeration bound (where p is the smallest prime dividing the ...
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
The Group Isomorphism problem consists in deciding whether two input groups G1 and G2 given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the Group Nonisomorphism problem such that on input groups (G1, ...
Breaking the nlog n barrier for solvable-group isomorphism
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsWe consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ≌ H. The nlog n barrier for group isomorphism has withstood all attacks --- even for the special cases of p-groups and ...






Comments