Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-23T05:38:59.565Z Has data issue: false hasContentIssue false

ON THE FREE SPECTRUM OF THE VARIETY GENERATED BY THE COMBINATORIAL COMPLETELY 0-SIMPLE SEMIGROUPS

Published online by Cambridge University Press:  01 January 2007

KAMILLA KÁTAI-URBÁN
Affiliation:
Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, H-6720 Szeged, Hungary e-mail: [email protected]
CSABA SZABÓ
Affiliation:
Eötvös Loránd University, Department of Algebra and Number Theory, 1117 Budapest, Pázmány Péter sétány 1/c, Hungary e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract.

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We give an asymptotic bound for the size of the n-generated relatively free semigroup in the variety generated by all combinatorial strictly 0-simple semigroups.

Keywords

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2007

References

REFERENCES

1.Berman, J., Free spectra gaps and tame congruence, Int. J. Algebra Comput. 5 (1995), 6651672.CrossRefGoogle Scholar
2.Graham, L. R., On finite 0-simple semigroups and graph theory, Math. Syst. Theory 2 (1968), 325339.CrossRefGoogle Scholar
3.Higman, G., The order of relatively free groups, in Proceedings of the International Conference on the Theory of Groups, Canberra 1965 (Gordon and Breach, 1967), 153–163.Google Scholar
4.Hobby, D. and Mc Kenzie, R., The structure of finite algebras, Contemporary Mathematics No. 76 (Amer. Math. Soc., Providence, 1988).CrossRefGoogle Scholar
5.Houghton, C. H., Completely 0-simple semigroups and their associated graphs and groups, Semigroup Forum 37 (1977), 4167.CrossRefGoogle Scholar
6.Kátai-Urbán, K., and Szabó, Cs., Free spectrum of the variety generated by the five element combinatorial Brandt semigroup, Semigroup Forum, to appearGoogle Scholar
7.Mashevitzky, G., Completely simple and completely 0-simple semigroup identities, Semigroup Forum 37 (1988), 253264.CrossRefGoogle Scholar
8.Neumann, P., {Some indecomposable varieties of groups}, Quart. J, Math., Oxford Ser. 2 14 (1963), 4650.CrossRefGoogle Scholar
9.Petrich, M., Inverse semigroups (Wiley and Sons, New York, 1984).Google Scholar
10.Seif, S. and Szabó, Cs., Algebra complexity problems involving graph homomorphisms, semigroups and the constraint satisfaction problem, J. Complexity 19 (2003), 153160.CrossRefGoogle Scholar
11.Seif, S., and Szabó, Cs., Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields, Semigroup Forum (to appear).Google Scholar
12.Trahtman, A. N., Identities of a five-element 0-simple semigroup, Semigroup Forum 48 (1994), 385387.CrossRefGoogle Scholar