A fast isomorphism test for groups of genus 2

Abstract

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We also report on the performance of an implementation of the algorithm in the computer algebra system {\sc magma}.

39 pages, 5 figures

References in corpus (2)

• Problems of classifying associative or Lie algebras and triples of symmetric or skew-symmetric matrices are wild
• Automorphisms of small prime power groups

Cited by in corpus (18)

• Wildness for tensors
• The threshold for subgroup profiles to agree is $\Omega (\log n)$
• Wildness of the problems of classifying two-dimensional spaces of commuting linear operators and certain Lie algebras
• Isomorphism testing of groups of cube-free order
• Polynomial-time isomorphism testing of groups of most finite orders
• A spectral theory for transverse tensor operators
• On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
• Hessian matrices, automorphisms of $p$-groups, and torsion points of elliptic curves
• Duality between $p$-groups with three characteristic subgroups and semisimple anti-commutative algebras
• Smooth cuboids in group theory
• Normalizers and permutational isomorphisms in simply-exponential time
• On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
• Enumerating isoclinism classes of semi-extraspecial groups
• Tensor Isomorphism by conjugacy of Lie algebras
• Subgroups of simple groups are as diverse as possible
• Classification of a Class of Solvable Real Lie Algebras by using Techniques in Matrix Theory
• Turán and Ramsey problems for alternating multilinear maps