More Like this

1. Testing Isomorphism of Lattices over CM-Orders

   https://doi.org/10.1137/17M115390X  

   Lenstra, Hendrik W.; Silverberg, Alice (January 2019, SIAM Journal on Computing)
2. GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM

   https://doi.org/10.1142/9789813272880_0183  

   BABAI, LÁSZLÓ (May 2019, Proceedings of the International Congress of Mathematicians, ICM 2018)

   Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P / NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied by numerical parameters. Recent progress on the complexity of GI relies on a combination of the asymptotic theory of permutation groups and asymptotic properties of highly regular combinatorial structures called coherent configurations. Group theory provides the tools to infer either global symmetry or global irregularity from local information, eliminating the symmetry/regularity gap in the relevant scenario; the resulting global structure is the subject of combinatorial analysis. These structural studies are melded in a divide-and-conquer algorithmic framework pioneered in the GI context by Eugene M. Luks (1980). 

   more » « less
3. Jet closures and the local isomorphism problem

   https://doi.org/10.1016/j.jalgebra.2018.01.008  

   de Fernex, Tommaso; Ein, Lawrence; Ishii, Shihoko (May 2018, Journal of Algebra)
4. Bigalois Extensions and the Graph Isomorphism Game

   https://doi.org/10.1007/s00220-019-03563-9  

   Brannan, Michael; Chirvasitu, Alexandru; Eifler, Kari; Harris, Samuel; Paulsen, Vern; Su, Xiaoyu; Wasilewski, Mateusz (May 2020, Communications in Mathematical Physics)
5. Quantum isomorphism of graphs from association schemes

   https://doi.org/10.1016/j.jctb.2023.09.005  

   Chan, Ada; Martin, William J (January 2024, Journal of Combinatorial Theory, Series B)

   Using a key result of Mancinska and Roberson characterizing quantum isomorphism in terms of planar homomorphism counts and using the theory of scaffolds, the authors construct large families of graphs that are pairwise non-isomorphic yet quantum isomorphic. All examples so far arise from Hadamard matrices. 

   more » « less