Reduction of the group isomorphism problem to the group automorphism problem

Saveliy V. Skresanov

doi:10.1007/s10469-026-09817-5

Home/Archive/arXiv

arXiv · 2503.01180

Reduction of the group isomorphism problem to the group automorphism problem

Saveliy V. Skresanov

View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is polynomial-time reducible to the group automorphism problem. Reductions to other relevant problems like automorphism counting are also given.

Explore related subjects

cs.CC math.GR

Keep this discovery

BibTeX RIS

Saveliy V. Skresanov. 2025-03-03. Reduction of the group isomorphism problem to the group automorphism problem. https://doi.org/10.1007/s10469-026-09817-5

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CC subject math.GR subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

On the sample complexity of the generalized hidden shift problem over arbitrary finite groups

We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.

quant-ph↗

arXiv2026

Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups

The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general polynomial-time algorithm is known, classes of solvable and nilpotent groups being the main obstacles. In 2012 Babai and Qiao gave a polynomial-time isomorphism test for the class of solvable groups admitting normal series with abelian Sylow factors. We generalize their result and give a polynomial-time isomorphism test for solvable A-groups, i.e. solvable groups with abelian Sylow subgroups. The algorithm heavily relies both on the computational methods developed by Babai and Qiao, and structural properties of A-groups.

math.GR↗

arXiv2026

Algorithms for Finite Group Epimorphism Testing

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.

cs.DS↗