Abstract
In complete semigroups of unions BX(D) defined by semilattices of the class Σ1(X, 4), we describe the set of all external elements and show that it is a generating (and, therefore, irreducible) set of the semigroup BX(D). For a finite semigroup BX(D), we given a formula for calculating the number of elements of the generating set.
Similar content being viewed by others
References
O. Givradze, “Irreducible generating sets of complete semigroups of unions BX(D) defined by semilattices of the class Σ2(X, 4),” J. Math. Sci., 186, No. 5, 745–750 (2012).
O. Givradze, “The number of equivalences on a finite set,” Proc. A. Razmadze Math. Inst., 131, 121–122 (2003).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya. Tematicheskie Obzory, Vol. 177, Algebra, 2020.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Givradze, O. Irreducible Generating Sets of Complete Semigroups of Unions BX(D) Defined by Semilattices of the Class Σ1(X, 4). J Math Sci 275, 718–721 (2023). https://doi.org/10.1007/s10958-023-06712-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-023-06712-7
Keywords and phrases
- semilattice of unions
- complete semigroup of binary relations
- generating sets
- quasinormal representations of binary relations