Divisibility and laws in finite simple groups. (Q2634867): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Andreas Thom / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Anatoli Kondrat'ev / rank
 
Normal rank

Revision as of 13:14, 12 February 2024

scientific article
Language Label Description Also known as
English
Divisibility and laws in finite simple groups.
scientific article

    Statements

    Divisibility and laws in finite simple groups. (English)
    0 references
    0 references
    0 references
    10 February 2016
    0 references
    For any group \(\Gamma\), the divisibility function \(D_\Gamma\colon\Gamma\to\mathbb N\cup\{\infty\}\) is defined by \(D_\Gamma(\gamma)=\min\{[\Gamma:\Lambda]\mid\Lambda<\Gamma,\;\gamma\notin\Lambda\}\). Let \(\mathbf F_2\) be the free group with two generators and \(S=\{a,a^{-1},b, b^{-1}\}\) its natural symmetric generating set. Denote the associated word length function by \(|\cdot|\colon\mathbf F_2\to\mathbb N\) and set \(D_{\mathbf F_2}(n)=\max\{D_{\mathbf F_2}(\gamma)\mid\gamma\in\mathbf F_2,\;|\gamma|\leq n\}\). For a group \(\Gamma\), we say that \(\Gamma\) satisfies the (two-variable) law \(w\in\mathbf F_2\) if \(w(g,h)=e\) for any \(g,h\in\Gamma\). In the given paper, the authors provide new bounds for \(D_{\mathbf F_2}(n)\) and construct short laws for the symmetric groups \(\mathrm{Sym}(n)\). The construction is random and relies on the classification of finite simple groups. They also give bounds on the length of laws for finite simple groups of Lie type.
    0 references
    finite simple groups
    0 references
    free groups
    0 references
    divisibility function
    0 references
    laws
    0 references
    symmetric groups
    0 references
    finite groups of Lie type
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references