Metraipolis › archive › dc_b77a44e747ae
Faster Isomorphism for Groups of Class 2 — arXiv:2611.05920
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05920
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:31:34.625Z
- SHA-256 of the archived text
b5713eacf137b07470919ef3e475a6f130d548cab171dd6e261f448c6c783a95- Stable URL of this page
https://metraipolis.com/documento/dc_b77a44e747ae
How to cite
Faster Isomorphism for Groups of Class 2 — arXiv:2611.05920 — arXiv (en), https://arxiv.org/abs/2611.05920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b77a44e747ae (Metraipolis archive dc_b77a44e747ae, sha256 b5713eacf137b07470919ef3e475a6f130d548cab171dd6e261f448c6c783a95)
BibTeX
@misc{dcb77a44e747ae,
title = {Faster Isomorphism for Groups of Class 2 — arXiv:2611.05920},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05920},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b77a44e747ae; sha256 b5713eacf137b07470919ef3e475a6f130d548cab171dd6e261f448c6c783a95},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05920. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The finite-group isomorphism problem asks whether two groups, given by their Cayley tables, are isomorphic. Despite decades of study, obtaining an $N^{o(\log N)}$-time algorithm for general groups of order $N$ remains a major open challenge. Groups of nilpotency class $2$ have long been a central obstacle to achieving this goal. Recent breakthroughs have established $N^{o(\log N)}$-time algorithms for $p$-groups of class $2$ with odd $p$ (Sun, STOC '23; Ivanyos-Mendoza-Qiao-Sun-Zhang, FOCS '24; Grochow-Qiao-Stange-Sun, STOC '25) and for groups of Frattini class $2$ (Grochow-Ivanyos-Qiao-Sun, FOCS '26). However, the problem remained open for general groups of class $2$. In this paper, we present an algorithm for testing isomorphism of groups of class $2$, with running time $N^{O((\log N)^{25/26} \log \log N)}$. Our algorithm combines a tensor-based restriction of the search space, an encoding of group relations by alternating matrix tuples, and an orbit computation to recover the remaining central power information.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.05920 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:21:04.024Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).