Recognising the small Ree groups in their natural representations.

From MaRDI portal
Publication:404240

DOI10.1016/J.JALGEBRA.2014.06.017zbMATH Open1303.20009arXiv1206.0411OpenAlexW2167058668MaRDI QIDQ404240FDOQ404240


Authors: Henrik Bรครคrnhielm Edit this on Wikidata


Publication date: 4 September 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups 2G_2(q) = Ree(q), where q = 3^{2m + 1} for some m > 0, in their natural representations of degree 7. The input is a generating set X. The constructive recognition algorithm is polynomial time given a discrete logarithm oracle. The constructive membership testing consists of a pre-processing step, that only needs to be executed once for a given X, and a main step. The latter is polynomial time, and the former is polynomial time given a discrete logarithm oracle. Implementations of the algorithms are available for the computer algebra system MAGMA.


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




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Recognising the small Ree groups in their natural representations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404240)