2017
DOI: 10.1016/j.jalgebra.2016.12.007
|View full text |Cite
|
Sign up to set email alerts
|

A fast isomorphism test for groups whose Lie algebra has 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 magma.1991 Mathematics Subject Classification. 20D15, 20D45, 15A22, 20B40.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
26
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 24 publications
(26 citation statements)
references
References 37 publications
0
26
0
Order By: Relevance
“…The algorithms of [21] have a complexity of O(p + e 2ω log 2 p), where 2 ≤ ω < 3 is the exponent of matrix multiplication, see [31,Chapter 12]. In the special case of groups in H 2 p,e , Brooksbank, Maglione, and the author give an O(p 3 + e ω log 2 p)-time algorithm [7]. Note that it takes Ω(e 2 log 2 p) bits to input the groups in H 2 p,e by any of the standard methods, including matrices, presentations, or permutations.…”
Section: Theorem 17 ([21]mentioning
confidence: 99%
See 4 more Smart Citations
“…The algorithms of [21] have a complexity of O(p + e 2ω log 2 p), where 2 ≤ ω < 3 is the exponent of matrix multiplication, see [31,Chapter 12]. In the special case of groups in H 2 p,e , Brooksbank, Maglione, and the author give an O(p 3 + e ω log 2 p)-time algorithm [7]. Note that it takes Ω(e 2 log 2 p) bits to input the groups in H 2 p,e by any of the standard methods, including matrices, presentations, or permutations.…”
Section: Theorem 17 ([21]mentioning
confidence: 99%
“…These algorithms have been implemented in the computer algebra system Magma [5] and decide isomorphism for groups as large as n = 5 256 in about an hour on a general-purpose personal computer [7, Figure 1.1]. The algorithms in [7] further give a complete invariant for the groups in H 2 p,e , which is a homogeneous polynomial of degree e in F p [x, y]. This implies that the number of isomorphism classes in H 2 p,e is at most p e ; see [7,Proposition 9.2].…”
Section: Theorem 17 ([21]mentioning
confidence: 99%
See 3 more Smart Citations