On a constant word in finite semigroups (Q581674)

A simple algebraic proof (the known one was combinatorial) is presented for the following theorem: in every finite semigroup S there exist elements \(a_ 1,...,a_{k+1}\in S\) and integers \(i_ 1,...,i_ k\) such that the word \(a_ 1x_ 1^{i1}a_ 2...a_ kx_ k^{ik}a_{k+1}\) is constant, i.e. does not depend on \(x_ 1,...,x_ k\). Several subcases and connected questions are considered, e.g. when \(ax^ n\), \(ax^ nb\) are constant, is the integer k bounded (in the class of all semigroups) from above (no) etc.