\(SL_ 3(2^ n)\) as a completion of an amalgam of type \(L_ 3(2)\) (Q689807): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Failure of factorization and primitive amalgams of index (3,3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of trivalent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal parabolic systems and small representations / rank
 
Normal rank

Latest revision as of 10:43, 22 May 2024

scientific article
Language Label Description Also known as
English
\(SL_ 3(2^ n)\) as a completion of an amalgam of type \(L_ 3(2)\)
scientific article

    Statements

    \(SL_ 3(2^ n)\) as a completion of an amalgam of type \(L_ 3(2)\) (English)
    0 references
    0 references
    15 November 1993
    0 references
    The author shows that SL\((3,2^ n)\), \(n\neq 2\), is generated by subgroups \(X\), \(Y\), \(X \cong Y \cong S_ 4\), \(X \cap Y = B \cong D_ 8\). For this he gives concrete matrices for the elements in \(X\) and \(Y\) and shows that these generate \(\text{SL}(3,2^ n)\). The proof depends on the interesting fact that for \(n > 2\) there is an \(\alpha \in GF(2^ n)\) such that \(x^ 3 + (\alpha + 1)x^ 2 + \alpha x + 1\) is irreducible. This is not true for \(n = 2\) as \(\alpha^ 2\) is always a root. In fact the groups \(X\) and \(Y\) constructed in the proof just generate \(3A_ 6\) in \(\text{SL}(3,4)\). Finally the author shows that there are no subgroups \(X\), \(Y\) in \(SL(3,4)\), \(X\cong Y \cong S_ 4\), \(X \cap Y \cong D_ 8\), such that \(\langle X,Y\rangle = SL(3,4)\).
    0 references
    amalgam
    0 references
    generators
    0 references
    SL\((3,2^ n)\)
    0 references
    subgroups
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references