Compactness of systems of equations in semigroups

1Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider systems ui = vi (i ∈ I) of equations in semigroups over finite sets of variables. A semigroup S is said to satisfy the compactness property (or CP, for short), if each system of equations has an equivalent finite subsystem. It is shown that all monoids in a variety V satisfy CP, if and only if the finitely generated monoids in V satisfy the maximal condition on congruences. We also show that if a finitely generated semigroup S satisfies CP, then S is necessarily hopfian and satisfies the chain condition on idempotents. Finally, we give three simple examples (the bicyclic monoid, the free monogenic inverse semigroup and the Baumslag-Solitar group) which do not satisfy CP, and show that the above necessary conditions are not sufficient.

Cite

CITATION STYLE

APA

Harju, T., Karhumäki, J., & Plandowski, W. (1995). Compactness of systems of equations in semigroups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 944, pp. 444–454). Springer Verlag. https://doi.org/10.1007/3-540-60084-1_95

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free