On some finiteness conditions in semigroup and group theory (Q1313473): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 02:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some finiteness conditions in semigroup and group theory |
scientific article |
Statements
On some finiteness conditions in semigroup and group theory (English)
0 references
16 March 1995
0 references
The paper answers in the negative questions stated by \textit{L. N. Shevrin} [Izv. Akad. Nauk SSSR, Ser. Mat. 29, 553-566 (1965; Zbl 0133.279)]. A semigroup \(S\) satisfies the maximal (minimal) condition -- shortly is \((Mx)\) (\((Mn)\)) -- if every ascending (descending, respectively) chain stabilizes. A semigroup \(S\) has finite rank \(r\) (shortly is \((Rn)\)) if it has a generating set of \(r\) elements and \(r\) is the least such number. A semigroup \(S\) is of finite breadth \(b\) (shortly is \((Br)\)) if for every set of \(m\) elements \(m > b\), \(S\) has a subset with \(b\) elements both generating the same subsemigroup, and \(b\) is the least such number. A semigroup \(S\) has finite length \(\ell\) (is \((Ln)\)) if in every ascending chain of subsemigroups of \(S\) consisting of \(\ell + 2\) terms there is a repetition and \(\ell\) is the least such number. Obviously condition \((Ln)\) implies conditions \((Mx)\), \((Mn)\) and \((Br)\), moreover \((Br)\) implies \((Rn)\). It is proved that (a) \((Mx)\) and \((Mn)\) and \((Br)\) do not imply \((Ln)\), (b) \((Mx)\) and \((Mn)\) and \((Rn)\) do not imply \((Br)\), (c) \((Mx)\) and \((Mn)\) do not imply \((Rn)\), (d) \((Mx)\) and \((Br)\) do not imply \((Mn)\), (e) \((Mn)\) and \((Br)\) do not imply \((Mx)\).
0 references
free amalgam
0 references
words over an alphabet
0 references
defining relations
0 references
chain conditions
0 references
maximal condition
0 references
minimal condition
0 references
finite rank
0 references
generating set
0 references
finite breadth
0 references
finite length
0 references