Square root of an element in PSL2(Fp), SL2(Fp), GL2(Fp) and An. Verbal width by set of squares in alternating group An and Mathieu groups
Abstract
The problems of square root from group element existing in SL2(Fp), PSL2(Fp) and GL2(Fp) were solved. The similar goal of root finding was reached in the GM algorithm adjoining an n-th root of a generator results in a discrete group for group PSL(2,R), but we consider this question over finite field Fp. Well known the Cayley-Hamilton method Pell for computing the square roots of the matrix Mn can give answer of square roots existing over finite field only after computation of det Mn and some real Pell-Lucas numbers by using Bine formula. Over method gives answer about existing Mn without exponents M to n-th power. We use only trace of M or only eigenvalues of M. In paper "Computing n-th roots in SL2 and Fibonacci polynomials" it was only the Anisotropic case of group SL1(Q) solved, where Q is a quaternion division algebra over k was considered. The authors of Amit considered criterion to be square only for case Fp is a field of characteristic not equal 2. We solve this problem even for fields F2 and F2n. The criterion to g ∈ SL2 (F2) be square in SL2(F2) was not found by them what was declared in a separate sentence. The criterion of squareness in An is presented. The necessary and sufficient conditions when an element of alternating group g An and GL2(Fp) as well as for SL2(Fp) can be presented as a squares of one element are also found by us. Some necessary conditions to an element g∈ An being the square in An are investigated. The criterion square root of an element existing in PSL2(Fp) is found. The criterion of existing an element square root in PSL2(Fp) is found.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.