On some questions and conjectures in the combinatorial theory of semigroups (Q1345736)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some questions and conjectures in the combinatorial theory of semigroups |
scientific article |
Statements
On some questions and conjectures in the combinatorial theory of semigroups (English)
0 references
30 October 1995
0 references
A semigroup \(S\) is repetitive if for each morphism \(\varphi : A^ + \to S\) and each integer \(k\), each long enough word contains \(k\) consecutive factors which are equal \(\text{mod }\varphi\). The authors show that there exists a (non abelian) group which is non repetitive and all whose proper subgroups are repetitive. They use a result of Ol'shanskij answering a question of Schmidt. They also show that a non repetitive semigroup, all whose subsemigroups are repetitive, must be a group equal to its derived subgroup. Moreover, a finitely generated semigroup, with linear growth and which is left cancellable, is repetitive. If \(\varphi : A^ + \to S\), \(A\) finite, is a repetitive morphism and if \(S\) satisfies a certain property \(\Sigma\), then \(S\) is repetitive. Many other results and problems are discussed.
0 references
perfect groups
0 references
permutations
0 references
repetitive subsemigroups
0 references
words
0 references
nonrepetitive semigroups
0 references
groups
0 references
finitely generated semigroups
0 references
linear growth
0 references
left cancellable semigroups
0 references
repetitive morphisms
0 references