A note on the Burnside problem for semigroups
The author proves that a periodic semigroup S is finite if and only if there exist a finite alphabet A and a strongly repetitive epimorphism \(\phi\) from the free semigroup \(A^+\) on A onto S, where strongly repetive means that: for any map \(F: {\mathbb{N}}\to {\mathbb{N}}\) there exists an integer r such that any word in \(A^+\) of length greater than r may be factorized as \(w=hv_ 1...v_{F(p)}h'\), for some integer p and some words \(h,h',v_ i\) satisfying: \(1\leq | v_ i| \leq p\) and \(\nu_ 1\phi =\nu_ 2\phi =...=\nu_ p\phi\). The only if part is a theorem of \textit{J. Justin} [J. Comb. Theory, Ser. A 12, 357-367 (1972; Zbl 0248.05003)].
- A finiteness condition for finitely generated semigroups
- An interesting combinatorial method in the theory of locally finite semigroups
- Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
- scientific article; zbMATH DE number 3682022 (Why is no real title available?)
- On the Burnside problem for semigroups
- Sul problema di Burnside per i semigruppi e i linguaggi
- The van der Waerden theorem and the Burnside problem for semigroups
- On uniformly repetitive semigroups
- Burnside marks and solution of two problems of Borevich on polynormal subgroups
- On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra
- A theorem in semigroups inspired by the restricted Burnside problem
- scientific article; zbMATH DE number 4198333 (Why is no real title available?)
- scientific article; zbMATH DE number 3979372 (Why is no real title available?)
- THE RESTRICTED BURNSIDE PROBLEM FOR VARIETIES OF SEMIGROUPS
- Restricted Burnside problem for semigroups and its application to language theory
This page was built for publication: A note on the Burnside problem for semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759839)
