Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model

  title={Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-R{\'e}nyi Model},
  author={Yinan Li and Youming Qiao},
  journal={2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)},
  • Yinan Li, Youming Qiao
  • Published 15 August 2017
  • Mathematics, Computer Science
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. [] Key MethodIn 1970s, Babai, Erdős, and Selkow presented the first average-case efficient graph isomorphism testing algorithm (SIAM J Computing, 1980). Inspired by that algorithm, we devise an average-case efficient algorithm for the alternating matrix space isometry problem over a key range of parameters, in a random model of alternating matrix spaces…

Figures from this paper

Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
Besides removing the restriction on the relation between n and m, the algorithm is considerably simpler, and the average-case analysis is stronger, and it improves significantly over default (brute-force) algorithms for this problem.
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
This work defines the complexity class TI, namely problems that reduce to the Tensor Isomorphism (TI) problem in polynomial time, and gives multipartite-to-tripartite entanglement transformation procedure, that preserves equivalence under stochastic local operations and classical communication.
Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
This work develops an algorithm that takes two cubic forms, f, g, and decides whether they are isomorphic in time, and shows that they are both Tensor Isomorphism-complete (Grochow-Qiao, ITCS, 2021), therefore is equivalent to testing isomorphism of cubic forms over most fields.
On the Weisfeiler-Leman Dimension of Finite Groups
The results indicate that the Weisfeiler-Leman algorithm can be more effective in distinguishing groups than in distinguishing graphs based on similar combinatorial constructions.
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
This paper considers the problems of testing isomorphism of tensors, $p-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography, and suggests that they form a rich and robust equivalence class, which is called Tensor Isomorphism-complete, or TI-complete.
Incorporating Weisfeiler-Leman into algorithms for group isomorphism
This paper shows how to combine several state-of-the-art GpI algorithms for specific group classes into an algorithm for general G pI, namely: composition series isomorphism, recursively-refineable filters, and low-genus GPI.
Tur\'an and Ramsey problems for alternating multilinear maps
Guided by the connections between hypergraphs and exterior algebras, we study Turan and Ramsey type problems for alternating multilinear maps. This study lies at the intersection of combinatorics,
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
Deterministically reveal two families of singularity witnesses caused by the skew-symmetric structure, which represents a natural next step for the polynomial identity testing problem following the direction set up by the recent resolution of the non-commutative rank problem.
Connections between graphs and matrix spaces
Given a bipartite graphG, the graphical matrix space SG consists of matrices whose non-zero entries can only be at those positions corresponding to edges in G. Tutte (J. London Math. Soc., 1947),
Tensor Isomorphism by conjugacy of Lie algebras
. We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called


On the Group and Color Isomorphism Problems
The results demonstrate that, just as the alternatin g group was a barrier to faster algorithms for graph isomorphism for three decades, the projective special linear group is an obstacle to fastergorithms for group isomorphicism.
Monte-Carlo algorithms in graph isomorphism testing
Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly
Graph Isomorphism in Quasipolynomial Time
The algorithm builds on Luks’s SI framework and attacks the barrier configurations for Luks's algorithm by group theoretic “local certificates” and combinatorial canonical partitioning techniques and shows that in a well-defined sense, Johnson graphs are the only obstructions to effective canonical partitioned.
Graph isomorphism in quasipolynomial time [extended abstract]
  • L. Babai
  • Mathematics, Computer Science
  • 2016
This work builds on Luks’s framework and attack the obstructions to efficient Luks recurrence via an interplay between local and global symmetry, and constructs group theoretic “local certificates” to certify the presence or absence of local symmetry.
Isomorphism of graphs of bounded valence can be tested in polynomial time
  • E. Luks
  • Mathematics
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
Testing isomorphism of graphs of valence ≤ t is polynomial-time reducible to the color automorphism problem for groups with small simple sections, and some results on primitive permutation groups are used to show that the algorithm runs inPolynomial time.
The Graph Isomorphism Problem
A highlight of the conference was the presentation of a new quasi-polynomial time algorithm for the Graph Isomorphism Problem, providing the first improvement since 1983.
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
A polynomial-time algorithm to test isomorphism for the largest class of solvable groups yet, namely groups with abelian Sylow towers, and develops an algorithm for a parameterized versin of the graph-isomorphism-hard setwise stabilizer problem, which may be of independent interest.
Algorithms for Group Isomorphism via Group Extensions and Cohomology
This work solves GPI in nO(log log n) time for central-radical groups, and in polynomial time for several prominent subclasses of central- Radical groups, which is the first time that a nontrivial algorithm with worst-case guarantees has tackled both aspects of GPI-actions and cohomology-simultaneously.
Non-commutative Edmonds’ problem and matrix semi-invariants
This paper considers the non-commutative version of Edmonds’ problem: compute the rank of T over the free skew field by using an algorithm of Gurvits, and assuming the above bound of sigma for R(n, m) over Q, deciding whether or not T has non-Commutative rank < n over Q can be done deterministically in time polynomial in the input size and $$sigma}$$σ.
Hypergraph isomorphism and structural equivalence of Boolean functions
  • E. Luks
  • Mathematics, Computer Science
    STOC '99
  • 1999
It is shown that hypergraph isomorphism can be tested in time O(c”), where n is the sire of the vertex set, and an NC test of equivalence of truth tables under permutation of variables alone is obtained.