SearcharxivSearch

arXiv · 2410.23473

Semigroups uniquely determined by one-sided identity and zero sets

Abstract

For a groupoid $S$ with elements $a$ and $b$, if $ba = a$, then $b$ is a left identity of $a$ and $a$ is a right zero of $b$. We define the left identity set of $a$ to be the set of all left identities of $a$ in $S$, and similarly for the right identity set of $a$ in $S$. We defined the left zero set of $a$ to be the set of all left zeroes of $a$ in $S$, and similarly for the right zero set of $a$. The one-sided identity and zero sets of a semigroup can be utilized in the determination of its maximal subgroups, maximal left and right zero subsemigroups, maximal left and right subgroups, and rectangular band subsemigroups. A band is an idempotent semigroup. Every commutative band is a semilattice and uniquely determined by the left and right identity sets of its elements or equivalently by the left and right zero sets of its elements. We generalize this notion by defining a groupoid or semigroup to be stabilized with respect to binary relations, in particular the binary relations defined by the one-sided identity and zero sets of its elements, if and only if for any groupoid or semigroup on the same set with the same binary relations, their binary operations are identical. We prove every right group with maximal subgroup size $2$ is a stabilized semigroup with respect to the one-sided identity [zero] sets of its elements. We define a commutative-rectangular band to be a band in which every pair of elements either commutes or are generalized inverses of each other, and we prove a commutative-rectangular band is a stabilized semigroup with respect to the one-sided identity [zero] sets of its elements.

Explore related subjects

Keep this discovery

BibTeXRIS

Julia Maddox. 2024-10-30. Semigroups uniquely determined by one-sided identity and zero sets. https://arxiv.org/abs/2410.23473

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR