WeChat Mini Program
Old Version Features

On the Complexity of Identifying Groups Without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness

arXiv · Computational Complexity(2025)

Cited 0|Views0
Abstract
In this paper, we exhibit an ^3 isomorphism test for groups without Abelian normal subgroups (a.k.a. Fitting-free groups), a class for which isomorphism testing was previously known to be in 𝖯 (Babai, Codenotti, and Qiao; ICALP '12). Here, we leverage the fact that G/PKer(G) can be viewed as permutation group of degree O(log |G|). As G is given by its multiplication table, we are able to implement the solution for the corresponding instance of Twisted Code Equivalence in ^3. In sharp contrast, we show that when our groups are specified by a generating set of permutations, isomorphism testing of Fitting-free groups is at least as hard as Graph Isomorphism and Linear Code Equivalence (the latter being -hard and having no known subexponential-time algorithm). Lastly, we show that any Fitting-free group of order n is identified by formulas (without counting) using only O(loglog n) variables. This is in contrast to the fact that there are infinite families of Abelian groups that are not identified by formulas with o(log n) variables (Grochow Levet, FCT '23).
More
Translated text
PDF
Bibtex
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
Summary is being generated by the instructions you defined