On the semigroup generating by extended bicyclic semigroup and a $\omega$-closed family
Oleg Gutik, Inna Pozdnyakova

TL;DR
This paper introduces an algebraic extension of the extended bicyclic semigroup based on an $ ext{ω}$-closed family, analyzing its structure, relations, and conditions for various types of simplicity and isomorphisms.
Contribution
It defines and studies the properties of the semigroup $oldsymbol{B}_{ ext{Z}}^{ ext{F}}$, including its structure, Green's relations, and criteria for simplicity and isomorphism to known semigroups.
Findings
$oldsymbol{B}_{ ext{Z}}^{ ext{F}}$ is a combinatorial inverse semigroup.
Criteria for simplicity, $0$-simplicity, bisimplicity, and $0$-bisimplicity are established.
When $ ext{F}$ consists of singletons and empty set, $oldsymbol{B}_{ ext{Z}}^{ ext{F}}$ is isomorphic to the Brandt $ ext{λ}$-extension.
Abstract
The algebraic extension of the extended bicyclic semigroup for an arbitrary -closed family subsets of is introduced. It is proven that is a combinatorial inverse semigroup. Green's relations, the natural partial order on the semigroup and its set of idempotents are described. The criteria of simplicity, -simplicity, bisimplicity, -bisimplicity of the semigroup and the criterion for to be isomorphic to the extended bicyclic semigroup or the countable semigroup of matrix units are derived. It is proved that in the case when the family consists of all singletons of and the empty set, the semigroup…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Fuzzy and Soft Set Theory
