ABSTRACT
Primitive coherent configurations (PCCs) are edge-colored digraphs that generalize strongly regular graphs (SRGs), a class perceived as difficult for Graph Isomorphism (GI). Moreover, PCCs arise naturally as obstacles to combinatorial divide-and-conquer approaches for general GI. In a natural sense, the isomorphism problem for PCCs is a stepping stone between SRGs and general GI. In his 1981 paper in the Annals of Math., Babai proposed a combinatorial approach to GI testing via an analysis of the standard individualization/refinement (I/R) technique and proved that I/R yields canonical forms of PCCs in time exp(~O(n1/2)). (The tilde hides polylogarithmic factors.) We improve this bound to exp(~O(n1/3)). This is faster than the current best bound, exp(~O(n1/2)), for general GI, and subsumes Spielman's exp(~O(n1/3)) bound for SRGs (STOC'96, only recently improved to exp(~O(n1/5)) by the present authors and their coauthors (FOCS'13)).
Our result implies an exp(~O(n1/3)) upper bound on the number of automorphisms of PCCs with certain easily described and recognized exceptions, making the first progress in 33 years on an old conjecture of Babai. The emergence of exceptions illuminates the technical difficulties: we had to separate these cases from the rest. For the analysis we develop a new combinatorial structure theory for PCCs that in particular demonstrates the presence of "asymptotically uniform clique geometries" among the constituent graphs of PCCs in a certain range of the parameters.
A corollary to Babai's 1981 result was an exp(~O(n1/2)) upper bound on the order of primitive but not doubly transitive permutation groups, solving a then 100-year old problem in group theory. An improved bound of exp(~O(n1/3)) (with known exceptions) follows from our combinatorial result. This bound was previously known (Cameron, 1981) only through the Classification of Finite Simple Groups. We note that upper bounds on the order of primitive permutation groups are central to the application of Luks's group theoretic divide-and-conquer methods to GI.
- L. Babai. Monte Carlo algorithms in graph isomorphism testing. Tech. Report 79--10, D' ep. Math. et Stat., Univ. de Montreal, 1979. Available at: http://people.cs.uchicago.edu/ laci/lasvegas79.pdf.Google Scholar
- L. Babai. On the complexity of canonical labeling of strongly regular graphs. SIAM J. Comput., 9(1):212--216, 1980.Google ScholarDigital Library
- L. Babai. On the order of uniprimitive permutation groups. Ann. of Math., 113(3):553--568, 1981.Google ScholarCross Ref
- L. Babai. On the automorphism groups of strongly regular graphs I. In Proc. 5th ITCS, pages 359--368, 2014. Google ScholarDigital Library
- L. Babai, X. Chen, X. Sun, S.-H. Teng, and J. Wilmes. Faster canonical forms for strongly regular graphs. In Proc. 54th FOCS, pages 157--166, 2013. Google ScholarDigital Library
- L. Babai and P. Codenotti. Isomorphism of hypergraphs of low rank in moderately exponential time. In Proc. 49th FOCS, pages 667--676, 2008. Google ScholarDigital Library
- L. Babai, W. M. Kantor, and E. M. Luks. Computational complexity and the classification of finite simple groups. In Proc. 24th FOCS, pages 162--171, 1983. Google ScholarDigital Library
- L. Babai and E. M. Luks. Canonical labeling of graphs. In Proc. 15th STOC, pages 171--183, 1983. Google ScholarDigital Library
- L. Babai and J. Wilmes. Asymptotic Delsarte cliques in distance-regular graphs. 2013. To appear: J. Algebr. Comb.Google Scholar
- L. Babai and J. Wilmes. Quasipolynomial-time canonical form for Steiner designs. In Proc. 45th STOC, pages 261--270, 2013. Google ScholarDigital Library
- J.-Y. Cai, M. Fürer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389--410, 1992.Google ScholarCross Ref
- P. J. Cameron. Finite permutation groups and finite simple groups. Bull. London Math Soc., 13:1--22, 1981.Google ScholarCross Ref
- X. Chen, X. Sun, and S.-H. Teng. Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems. In Proc. 45th STOC, pages 271--280, 2013. Google ScholarDigital Library
- R. Frucht. Herstellung von Graphen mit vorgegebener abstrakter Gruppe. Composition Math., 6:239--250, 1938.Google Scholar
- O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof system. J. ACM, 38(1):691--729, 1991. Google ScholarDigital Library
- D. G. Higman. Coherent configurations I. Geometriae Dedicata, 4:1--32, 1975.Google ScholarCross Ref
- E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci., 25(1):42--65, 1982.Google ScholarCross Ref
- K. Metsch. On a characterization of bilinear forms graphs. European Journal of Combinatorics, 20:293--306, 1999. Google ScholarDigital Library
- G. L. Miller. Graph isomorphism, general remarks. In Proc. 9th STOC, pages 143--150, 1977. Google ScholarDigital Library
- A. Neumaier. Strongly regular graphs with smallest eigenvalue -m. Arch. Math., 33(4):392--400, 1979.Google ScholarCross Ref
- D. A. Spielman. Faster isomorphism testing of strongly regular graphs. In Proc. 28th STOC, pages 576--584, 1996. Google ScholarDigital Library
- B. Weisfeiler, editor. On Construction and Identification of Graphs, volume 558 of Lecture Notes in Mathematics. Springer-Verlag, 1976.Google ScholarCross Ref
- B. Weisfeiler and A. A. Leman. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Tech. Info., 9:12--16, 1968.Google Scholar
- V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich. Graph isomorphism problem. Zap. Nauchn. Sem. (LOMI), 118:83--158, 215, 1982.Google Scholar
Index Terms
- Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract
Recommendations
On the automorphism groups of strongly regular graphs I
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer scienceWe derive structural constraints on the automorphism groups of strongly regular (s.r.) graphs, giving a surprisingly strong answer to a decades-old problem, with tantalizing implications to testing isomorphism of s.r. graphs, and raising new ...
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingA standard heuristic for testing graph isomorphism is to first assign distinct labels to a small set of vertices of an input graph, and then propagate to create new vertex labels across the graph, aiming to assign distinct and isomorphism-invariant ...
Faster Canonical Forms for Strongly Regular Graphs
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceWe show that a canonical form for strongly regular (s.r.) graphs can be found in time exp(O~(n1/5)) and therefore isomorphism of s.r. graphs can be tested within the same time bound, where n is the number of vertices and the tilde hides a ...
Comments