scientific article; zbMATH DE number 1145875
A semigroup \(S\) is said to be \(n\)-permutable, where \(n\in\mathbb{N}\), \(n\geq 2\), if for every \((x_1,x_2,\dots,x_n)\in S^n\), there exists a non-trivial permutation \(\sigma\) in \(\Sigma_n\) such that \(x_1x_2\cdots x_n=x_{\sigma(1)}x_{\sigma(2)}\cdots x_{\sigma(n)}\). \(S\) is called permutable (\(S\) has the permutation property) if it is \(n\)-permutable for some integer \(n\geq 2\). This concept has been introduced by \textit{A. Restivo} and \textit{C. Reutenauer} [J. Algebra 89, 102-104 (1984; Zbl 0545.20051)]. They have proved that a finitely generated semigroup is finite if and only if it is periodic and permutable. Various modifications of the permutation property have been analyzed. A semigroup \(S\) is involutional if there exists an integer \(n\geq 2\) such that the product of any elements \(x_1,x_2,\dots,x_n\) of \(S\) can be rewritten as \(x_1x_2\cdots x_n=x_{\sigma(1)}x_{\sigma(2)}\cdots x_{\sigma(n)}\), for an involution \(\sigma\) of \(\Sigma_n\). (Recall that \(\sigma\in\Sigma_n\) is an involution if \(\sigma^2=\text{id}\) and \(\sigma\neq\text{id}\).) Some results on involutional semigroups are established. It is proved that a group is involutional if and only if it has the permutation property. Also a finitely generated semigroup is finite if and only if it is periodic and involutional.
- scientific article; zbMATH DE number 4198333
- A note on \(\omega\)-permutable semigroups
- scientific article; zbMATH DE number 4188090
- On the Burnside problem for semigroups
- scientific article; zbMATH DE number 9182
- scientific article; zbMATH DE number 4198334
- Semilattice decomposition of \(n_{(2)}\)-permutable semigroups
- Some combinatorial properties of infinite words and applications to semigroup theory
- scientific article; zbMATH DE number 571947
- Linear semigroups with permutation properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386053)