Search arXivSearch

arXiv · 1508.03033

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}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter A. Brooksbank, Joshua Maglione, James B. Wilson. 2015-08-12. A fast isomorphism test for groups of genus 2. https://doi.org/10.1016/j.jalgebra.2016.12.007

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

KEEP EXPLORING

Related papers

Subindices and subfactors of $\mathbb{Z}_n$ and $k$-index stability of finite groups

We study subindices, subfactors, and index stability in the cyclic group $\mathbb{Z}_n$. We prove several theorems that not only confirm a conjecture and resolve some open problems about index stability of such groups, but also provide basic tools for the characterization of finite $k$-index stable groups. As a consequence, we completely characterize all 2-element index stable subsets of $\mathbb{Z}_n$, obtain an exact closed formula for their density, and determine all $n$ for which every 2-subset is index unstable. Finally, we present some problems and a research project extending the study to 3-subsets and general $k$-subsets.

math.GR

Virtually generating graphs of pro-$p$ groups

We study the virtually generating graph of pro-$p$ groups. We show that various classes of pro-$p$ groups have connected virtually generating graph and we bound its diameter in these cases; e.g.\ compact subgroups of analytic groups over local fields and the Nottingham group.

math.GR

Surface subgroups of Baumslag doubles along short words

If $U$ is a minimal, diskbusting, finite list of words in a free group $F_n$ of rank $n$ such that the sum of the lengths of words in $U$ is at most $2n+4$, we prove that the natural presentation complex of the Baumslag double of $F_n$ along $U$ virtually contains a $π_1$-injective embedded closed hyperbolic surface. This verifies the Tiling Conjecture of Kim and Wilton for this type of lists of words, and in particular, implies that the corresponding Baumslag double contains a hyperbolic surface subgroup.

math.GR