Permutation properties with some restrictions. (Q1177096)

From MaRDI portal
Revision as of 11:14, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Permutation properties with some restrictions.
scientific article

    Statements

    Permutation properties with some restrictions. (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    Put \(N_ n=\{1,2,\dots,n\}\). Let \(S\) be a semigroup. Suppose that there exists an integer \(k>2\) such that to each \(k\)-tuple \((x_ 1,\dots,x_ k)\) of elements of \(S\) there is a permutation \(\alpha\) of \(N_ k\) such that \(x_ 1x_ 2\dots x_ k=x_{\alpha(1)}x_{\alpha(2)}\dots x_{\alpha(k)}\) and \(\alpha(1)\neq 1\), \(\alpha(k)\neq k\). The authors show that for any integer \(n\geq k^ 2-2\) \(S\) is fixed-point-free \(n\)- permutable i.e. to each \(n\)-tuple \((x_ 1,\dots,x_ n)\) of elements of \(S\) there is a fixed-point-free permutation \(\beta\) of \(N_ n\) such that \(x_ 1x_ 2\dots x_ n=x_{\beta(1)}x_{\beta(2)}\dots x_{\beta(n)}\) (Theorem 1). We say that a semigroup \(S\) is (weakly) cyclically permutable if there is an integer \(n\geqq 2\) such that to each \(n\)-tuple \((x_ 1,\dots,x_ n)\) of elements of \(S\) there (are two different cyclic permutations \(\alpha\), \(\beta\) of \(N_ n\) with \(x_{\alpha(1)}x_{\alpha(2)}\dots x_{\alpha(n)}=x_{\beta(1)}x_{\beta(2)}\dots x_{\beta(n)})\) is a cyclic permutation \(\sigma\neq id\) of \(N_ n\) with \(x_ 1x_ 2\dots x_ n=x_{\sigma(1)}x_{\sigma(2)}\dots x_{\sigma(n)}\). The authors characterize finite cyclically permutable semigroups (Theorem 3) and prove that a group \(S\) is fixed-point-free \(n\)-permutable for some integer \(n\geqq 2\) iff it is weakly cyclically permutable (Theorem 4).
    0 references
    permutation properties
    0 references
    semigroup
    0 references
    permutation
    0 references
    fixed-point-free \(n\)- permutable
    0 references
    cyclically-permutations
    0 references
    finite cyclically permutable semigroups
    0 references
    weakly cyclically permutable
    0 references

    Identifiers