Metraipolis › archive › dc_c0d2a32bb382
Algorithms for Finite Group Epimorphism Testing — arXiv:2609.07429
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07429
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T15:31:51.506Z
- SHA-256 of the archived text
d246b5bf0c4516676c743f3aec272b0960832da93c5faf75d2f7ab7fdb7b6746- Stable URL of this page
https://metraipolis.com/documento/dc_c0d2a32bb382
How to cite
Algorithms for Finite Group Epimorphism Testing — arXiv:2609.07429 — arXiv (en), https://arxiv.org/abs/2609.07429 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c0d2a32bb382 (Metraipolis archive dc_c0d2a32bb382, sha256 d246b5bf0c4516676c743f3aec272b0960832da93c5faf75d2f7ab7fdb7b6746)
BibTeX
@misc{dcc0d2a32bb382,
title = {Algorithms for Finite Group Epimorphism Testing — arXiv:2609.07429},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07429},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c0d2a32bb382; sha256 d246b5bf0c4516676c743f3aec272b0960832da93c5faf75d2f7ab7fdb7b6746},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07429. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Group Epimorphism Problem (GpEpi) asks, given two finite groups $G_1$ and $G_2$, whether there exists a surjective group homomorphism, or epimorphism, from $G_1$ to $G_2$. When the input groups are given by their multiplication (Cayley) tables, the problem admits a quasipolynomial-time algorithm in general, but little is known about its complexity for structured classes of finite groups. In this paper, we study the computational complexity of GpEpi for several well-studied classes of finite groups. Our main results are polynomial-time epimorphism tests for several classes of groups for which polynomial-time isomorphism testing was previously known: Groups with Abelian normal Hall subgroups with cyclic complement; Groups with (product of) elementary Abelian normal Hall subgroup with elementary Abelian complement; and Groups with some constraints on their Abelian chief factors. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC); Group Theory (math.GR). Pagina del lavoro: https://arxiv.org/abs/2609.07429 — 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-10-16T15:15:08.347Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).