SearcharxivSearch

arXiv · 1502.01651

Lattice-ordered abelian groups finitely generated as semirings

Abstract

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing that each such $\ell$-group has an order-unit so that we can use the results of Busaniche, Cabrer and Mundici [8]. Then we carefully analyze their construction in our setting to obtain the classification in terms of certain $\ell$-groups associated to rooted trees (Theorem 4.1). This classification result has a number of important applications: for example it implies a classification of finitely generated ideal-simple (commutative) semirings $S(+, \cdot)$ with idempotent addition and provides important information concerning the structure of general finitely generated ideal-simple (commutative) semirings, useful in obtaining further progress towards Conjecture 1.1 discussed in [2], [15].

Explore related subjects

Keep this discovery

BibTeXRIS

Vítězslav Kala. 2015-02-05. Lattice-ordered abelian groups finitely generated as semirings. https://doi.org/10.1216/jca-2017-9-3-387

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