Computing subgroups by exhibition in finite solvable groups (Q1599538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The \(\mathfrak F\)-normalizers of a finite soluble group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the computation of complements and normalizers in soluble groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite soluble groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Theorie der endlichen auflösbaren Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite soluble quotient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a soluble quotient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the order of a solvable permutation group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An internal approach to covering groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On internal formation theory / rank
 
Normal rank

Latest revision as of 10:29, 4 June 2024

scientific article
Language Label Description Also known as
English
Computing subgroups by exhibition in finite solvable groups
scientific article

    Statements

    Computing subgroups by exhibition in finite solvable groups (English)
    0 references
    0 references
    0 references
    11 June 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    finite solvable groups
    0 references
    system normalizers
    0 references
    covering subgroups
    0 references
    algorithms
    0 references
    complements
    0 references
    0 references