Normalizers of \(p\)-subgroups in finite groups. (Q1016491): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter J. Rowley / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Robert A. Wilson / rank
Normal rank
 
Property / author
 
Property / author: Peter J. Rowley / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Robert A. Wilson / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00013-008-2737-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112896218 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 19 March 2024

scientific article
Language Label Description Also known as
English
Normalizers of \(p\)-subgroups in finite groups.
scientific article

    Statements

    Normalizers of \(p\)-subgroups in finite groups. (English)
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    If \(G\) is a permutation group stored in a computer as a set of generating permutations, and \(H\) is a subgroup of \(G\), the standard way to compute \(N_G(H)\) is to compute a base and strong generating set first. This permits use of the powerful methods pioneered by Sims in the late 1960s to compute almost anything in the group. These methods are so efficient that if \(G\) is a matrix group, the usual way to proceed is to first convert \(G\) into a permutation group. However, it often turns out that the resulting permutations are unmanageably huge. Therefore it is desirable to develop other methods for matrix groups (or more generally, black-box groups). The paper under review reports on an implementation of such methods for \(H\) a \(p\)-group. The method for \(p=2\) is part of the folklore [see for example \textit{G. Butler}, J. Algebra 69, 67-81 (1981; Zbl 0457.20024)], but is here presented more systematically, and completely automated. Essentially, a number of composition series for \(H\) are computed, and for each one a set of random elements are found which centralize each composition factor. Since each composition factor is \(C_2\), this is essentially an involution centralizer calculation. For \(p\) odd, the same strategy is employed, but using the authors' method [described in Arch. Math. 85, No. 6, 485-489 (2005; Zbl 1137.20301)] for finding centralizers of odd-order elements.
    0 references
    normalizers
    0 references
    centralizers
    0 references
    \(p\)-subgroups
    0 references
    computational methods in group theory
    0 references
    matrix groups
    0 references
    black-box groups
    0 references
    composition series
    0 references

    Identifiers