The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups. (Q1001465)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups. |
scientific article; zbMATH DE number 5508758
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups. |
scientific article; zbMATH DE number 5508758 |
Statements
The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups. (English)
0 references
17 February 2009
0 references
A semigroup is called combinatorial if it does not contain nontrivial subgroups; a Rees matrix semigroup \((I\times G\times\Lambda)\cup\{0\}\) is combinatorial if the group \(G\) is trivial. Here are presented asymptotic formulas for the size of \(n\)-generated free combinatorial semigroups in all 9 varieties generated by combinatorial 0-simple semigroups.
0 references
varieties of semigroups
0 references
free spectra of varieties
0 references
combinatorial 0-simple semigroups
0 references
relatively free semigroups
0 references
0.9234132
0 references
0.92319596
0 references
0.91032684
0 references
0.89581054
0 references
0 references
0.8870702
0 references
0 references
