The threshold for subgroup profiles to agree is $\Omega(\log n)$

DOI10.4086/toc.2019.v015a019zbMath1494.68100arXiv1612.01444OpenAlexW2560327508MaRDI QIDQ5215666

James B. Wilson

Publication date: 12 February 2020

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.01444

zbMATH Keywords

\(p\)-groupsprofilesgroup isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Asymptotic properties of groups (20F69) Finite nilpotent groups, (p)-groups (20D15)

Related Items (3)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Subgroups of simple groups are as diverse as possible ⋮ Unnamed Item

This page was built for publication: The threshold for subgroup profiles to agree is $\Omega(\log n)$