SearcharxivSearch

arXiv · 0908.2132

Classification of finitely generated lattice-ordered abelian groups with order-unit

Abstract

A unital $\ell$-group $(G,u)$ is an abelian group $G$ equipped with a translation-invariant lattice-order and a distinguished element $u$, called order-unit, whose positive integer multiples eventually dominate each element of $G$. We classify finitely generated unital $\ell$-groups by sequences $\mathcal W = (W_{0},W_{1},...)$ of weighted abstract simplicial complexes, where $W_{t+1}$ is obtained from $W_{t}$ either by the classical Alexander binary stellar operation, or by deleting a maximal simplex of $W_{t}$. A simple criterion is given to recognize when two such sequences classify isomorphic unital $\ell$-groups. Many properties of the unital $\ell$-group $(G,u)$ can be directly read off from its associated sequence: for instance, the properties of being totally ordered, archimedean, finitely presented, simplicial, free.

Explore related subjects

Keep this discovery

BibTeXRIS

Manuela Busaniche, Leonardo Cabrer, Daniele Mundici. 2009-08-14. Classification of finitely generated lattice-ordered abelian groups with order-unit. https://arxiv.org/abs/0908.2132

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