A problem on semigroups satisfying permutation identities (Q1924514)

The author studies permutation properties of semigroups. Let \(\Sigma_n\) denote the symmetric group on \(\{1,2,\dots,n\}\). For a semigroup \(S\), a permutation \(\sigma\in\Sigma_n\), and an \(n\)-tuple \(x=(x_1,x_2,\dots,x_n)\in S^n\), denote \(x_\sigma=(x_{\sigma(1)},x_{\sigma(2)},\dots,x_{\sigma(n)})\). The semigroup \(S\) is said to be \(\sigma\)-permutable if \(x_{id}=x_\sigma\) for all \(x\in S^n\). Denote also by \(G_n(S)\) the set of permutations \(\sigma\in\Sigma_n\) for which \(S\) is \(\sigma\)-permutable. Among other results it is shown that \(G_{n+1}(S)=\Sigma_{n+1}\) holds, if there exists an integer \(2\leq k\leq n\) such that the following conditions are satisfied: (i) there exists a \(\sigma\in G_n(S)\) that has no fixed points \(i\geq k\), and (ii) all \(\sigma\in\Sigma_{n+1}\) fixing each \(i\geq k\) belong to \(G_{n+1}(S)\).