Shirshov's theorem and \(\omega\)-permutability of semigroups (Q1175762): Difference between revisions

The authors generalize theorems of Shirshov and others from finite to two-sided infinite words. Let \(A\) be a finite alphabet and suppose \(A^ +\) is lexicographically ordered. A factorization \(x=x_ 1\cdots x_ n\) of \(x\in A^ +\) with the property that for any nontrivial permutation of \(A\), the product of the resulting terms strictly precedes \(x\) in the ordering is called an ``\(n\)-divided factorization'' (and \(x\) is ``\(n\)- divided''.) A two-sided infinite word is ``\(\omega\)-divisible'' if it admits a factorization \(\cdots w_ iw_{i+1}\cdots\) such that for any \(i\in Z\) and for any \(n>0\), \(w_ iw_{i+1}\cdots w_{i+n-1}\) is an \(n\)-divided factorization. The first main theorem states that if \(s\) is an infinite word over \(A\) and \(A^ +\) is lexicographically ordered then there exists a two-sided infinite word \(t\) such that every finite factor of \(t\) is a factor of \(s\) and either \(t\) is periodic or \(t\) is \(\omega\)- divided. Shirshov's theorem, that any sufficiently long word over \(A\) contains either a factor which is \(n\)-divided or a factor which is a \(p\)th power follows, as does the extension to right infinite words by Varricchio. The remainder of the paper concerns applications to semigroups satisfying ``\(\omega\)-permutability'' and related conditions.