• Corpus ID: 146808876

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

@article{Brooksbank2019IncorporatingWI,
  title={Incorporating Weisfeiler-Leman into algorithms for group isomorphism},
  author={Peter A. Brooksbank and Joshua A. Grochow and Yinan Li and Youming Qiao and James B. Wilson},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.02518}
}
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show how to combine several state-of-the-art GpI algorithms for specific group classes into an algorithm for general GpI, namely: composition series isomorphism (Rosenbaum-Wagner, Theoret. Comp. Sci., 2015; Luks, 2015), recursively-refineable filters (Wilson, J… 

Figures from this paper

Weisfeiler-Leman for Group Isomorphism: Action Compatibility
TLDR
It is shown that a single, combinatorial algorithm (Weisfeiler–Leman) can identify those same group-theoretic structures in polynomial time and isomorphism testing even for Abelian groups into AC is put into AC.
On the Weisfeiler-Leman Dimension of Finite Groups
TLDR
The results indicate that the Weisfeiler-Leman algorithm can be more effective in distinguishing groups than in distinguishing graphs based on similar combinatorial constructions.
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension
TLDR
A new tool to define a canonical maximal central decomposition for groups is developed and it is shown that the Weisfeiler-Leman dimension of a group is at most one larger than the dimensions of its direct indecomposable factors.
Color Refinement, Homomorphisms, and Hypergraphs
TLDR
It is proved that the well-known color-refinement algorithm does not distinguish two hypergraphs G and H if and only if, for every connected Berge-acyclic hypergraph B, the authors have Hom(B,G) = Hom( B,H).
On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
TLDR
The main innovation is to develop linear-algebraic analogues of classical graph coloring gadgets, a key technique in studying the structural complexity of GI.
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
TLDR
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.
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
TLDR
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.
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
TLDR
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.

References

SHOWING 1-10 OF 75 REFERENCES
Algorithms for Group Isomorphism via Group Extensions and Cohomology
TLDR
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.
Code equivalence and group isomorphism
TLDR
A more hopeful program to find a polynomial-time algorithm for semisimple groups, defined as groups without abelian normal subgroups, is initiated and it is proved that the isomorphism problem for this class can be solved in time nO(log log n).
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
  • Yinan Li, Youming Qiao
  • Mathematics, Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
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 in vein of the Erd∝os-R´enyi model of random graphs is devised, and a linear algebraic analogue of the classical individualisation technique is developed.
Graph Isomorphism in Quasipolynomial Time
TLDR
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
    STOC
  • 2016
TLDR
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.
Groups St Andrews 1997 in Bath, I: A polynomial-time theory of black box groups I
TLDR
It is demonstrated that the “nonabelian normal structure” of matrix groups over finite fields can be mapped out in great detail by polynomial-time randomized (Monte Carlo) algorithms.
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)
TLDR
It is demonstrated that the obstacle to efficient algorithms is the presence of abelian normal subgroups; it is shown by giving a polynomial-time isomorphism test for groups without nontrivial abelians subgroups.
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
TLDR
Focusing on dimensions $k=1,2$, this work investigates subgraph patterns whose counts are $k-WL invariant, and whose occurrence is $k$- WL invariants, and achieves a complete description of all such patterns for dimension k=1 and considerably extend the previous results known for k=2.
Compatible filters for isomorphism testing
We provide the necessary framework to use filters in computational settings, in particular for finitely generated nilpotent groups. The main motivation for this is to take advantage of the associated
...
1
2
3
4
5
...