Cycle types in infinite permutation groups (Q1895618)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cycle types in infinite permutation groups
scientific article

    Statements

    Cycle types in infinite permutation groups (English)
    0 references
    0 references
    0 references
    21 April 1996
    0 references
    The main result of the paper is Theorem 1.1: Let \(G\) be a transitive permutation group of an infinite set \(\Omega\) and let \(k\) be a positive integer or \(k = \aleph_0\). Suppose that \(G\) contains an element \(g\) whose cycle decomposition consists of a single infinite cycle, a finite positive number of finite cycles of length at least 2 and at least \(k\) fixed points. (i) If \(k\) is finite, then \(G\) is \((k+1)\)-transitive on \(\Omega\). (ii) If \(k\) is infinite and \((G, \Omega)\) is primitive, then \(G\) is highly transitive. The proof of (ii) is quite hard and makes use of the recent classification of infinite primitive Jordan groups.
    0 references
    infinite primitive permutation groups
    0 references
    highly transitive groups
    0 references
    transitive permutation group
    0 references
    cycle decomposition
    0 references
    infinite primitive Jordan groups
    0 references

    Identifiers

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