No label defined (Q3986532)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 28995
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 28995

      Statements

      27 June 1992
      0 references
      probability that elements of a finite semigroup commute
      0 references
      finite noncommutative semigroup
      0 references
      nearly commutative
      0 references
      0 references
      Let \(S\) be a finite non-empty set and let \(*\) be a closed binary operation on \(S\). For \(x\in S\), let \(C_ S(x)=\{y\in S\mid x*y=y*x\}\). Let us define \(\text{Pr}(S)\) to be \(| S|^{-2}\sum_{x\in S}| C_ S(x)|\) so that \(\text{Pr}(S)\) is the probability that a pair of elements of \(S\), chosen at random, will commute with each other. If \(\{G,*\}\) is a group then there are severe restrictions on the values that \(\text{Pr}(G)\) may assume. For instance, if \(\text{Pr}(G)>5/8\) then \(\text{Pr}(G)=1\) (see \textit{W. H. Gustafson} [Am. Math. Mon. 80, 1031-1034 (1973; Zbl 0276.60013)]). If \(\{R,*\}\) is the multiplicative semigroup of a ring \(\{R,+,*\}\) then again there are severe restrictions on the values of \(\text{Pr}(R)\) (see \textit{D. MacHale} [ibid. 83, 30-32 (1976; Zbl 0289.60005)]). In the paper under review the author concentrates on the case where \(\{S,*\}\) is a semigroup. For each \(n\geq 4\), he shows that there is a semigroup \(T_ n\) of order \(n\) with \(\text{Pr}(T_ n)=1-2n^{-2}\). Hence, a finite noncommutative semigroup can be as nearly commutative as one may desire. For each \(n\), the author also constructs a semigroup \(W_ n\) of order \(n\) with \(\text{Pr}(W_ n)=n^{-1}\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references