SearcharxivSearch

arXiv · 2402.10103

Semiring arising as Lattice of Groupsemirings

Abstract

Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An important class of such unions is a semilattice of groups. Group semirings are semirings $(G,+,\cdot )$ where $(G,\cdot )$ is a group and $(G,+)$ is a left zero semigroup. We consider construction of semirings from classes of group semirings $\{G_\alpha :\alpha\in D \}$ indexed by a distributive lattice $D$. It is shown that if $S=\cup\{G_\alpha \}$ is a strong distributive lattice of group semirings $G_\alpha$ then the multiplicative semigroup $(S,\cdot)$ of the semiring $(S,+,\cdot)$ is a Clifford semigroup and the additive semigroup $(S,+)$ is a left normal band. Further in this case all the groups $G_\alpha $ are mutually isomorphic.

Explore related subjects

Keep this discovery

BibTeXRIS

A. R. Rajan, S. Sheena, C. S. Preenu. 2024-02-15. Semiring arising as Lattice of Groupsemirings. https://arxiv.org/abs/2402.10103

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