Classification of finitely generated lattice-ordered abelian groups with order-unit
Manuela Busaniche, Leonardo Cabrer, Daniele Mundici

TL;DR
This paper provides a classification of finitely generated unital lattice-ordered abelian groups using sequences of weighted simplicial complexes, linking algebraic properties to combinatorial structures.
Contribution
It introduces a novel classification method connecting unital $ extit{ ext{l}}$-groups with sequences of weighted simplicial complexes, enabling property analysis.
Findings
Classification via sequences of weighted simplicial complexes
Recognition criterion for isomorphic unital $ extit{ ext{l}}$-groups
Properties like total order and finitely presented can be read from sequences
Abstract
A unital -group is an abelian group equipped with a translation-invariant lattice-order and a distinguished element , called order-unit, whose positive integer multiples eventually dominate each element of . We classify finitely generated unital -groups by sequences of weighted abstract simplicial complexes, where is obtained from either by the classical Alexander binary stellar operation, or by deleting a maximal simplex of . A simple criterion is given to recognize when two such sequences classify isomorphic unital -groups. Many properties of the unital -group can be directly read off from its associated sequence: for instance, the properties of being totally ordered, archimedean, finitely presented, simplicial, free.
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
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rings, Modules, and Algebras
