Permutations which make transitive groups primitive. (Q2268542): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4858541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orders of the linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the Mathieu groups and associated Steiner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Symmetric Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Permutation Groups Containing a Cycle of Prime-Power Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive permutation groups containing a \(p\)-cycle / rank
 
Normal rank

Latest revision as of 13:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Permutations which make transitive groups primitive.
scientific article

    Statements

    Permutations which make transitive groups primitive. (English)
    0 references
    0 references
    8 March 2010
    0 references
    In the present paper the author studies some straightforward elementary conditions which ensure that a finite transitive permutation group \(G\) of degree \(d\) is primitive. The conditions considered are mostly that \(G\) contains a permutation having some specific cycle type, e.g. \([1,d-1]\) or \([n_1,\dots,n_r]\) where \(\gcd(n_i,n_j)=1\) for \(i\neq j\) and such that for no partition of the set \(\{n_1,\dots,n_r\}\) the parts add up to a constant proper divisor of \(d=\sum n_i\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite permutation groups
    0 references
    transitive permutation groups
    0 references
    primitive permutation groups
    0 references
    cycle types
    0 references
    generators
    0 references
    partitions
    0 references
    blocks
    0 references
    0 references
    0 references