On the orders of primitive groups with restricted nonabelian composition factors (Q1168415): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the order of uniprimitive permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of doubly transitive permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Permutation Groups and Finite Simple Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Abelian Subgroups of the Symmetric Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character Degrees and Derived Length of a Solvable Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orders of Primitive Permutation Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5721249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank

Latest revision as of 15:41, 13 June 2024

scientific article
Language Label Description Also known as
English
On the orders of primitive groups with restricted nonabelian composition factors
scientific article

    Statements

    On the orders of primitive groups with restricted nonabelian composition factors (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    primitive permutation groups
    0 references
    graph isomorphism
    0 references
    order of permutation group
    0 references
    primitive solvable group
    0 references
    nonabelian composition factor
    0 references
    finite simple groups
    0 references
    algorithm
    0 references
    polynomial time
    0 references

    Identifiers

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