Lattice-ordered abelian groups finitely generated as semirings
V\'it\v{e}zslav Kala

TL;DR
This paper classifies abelian lattice-ordered groups that are finitely generated as semirings, revealing their structure in terms of rooted trees and applying this to ideal-simple semirings.
Contribution
It provides a complete classification of finitely generated abelian ll-groups as semirings using rooted tree structures, extending previous results.
Findings
Classification in terms of rooted trees (Theorem 4.1)
Implications for finitely generated ideal-simple semirings
Progress towards Conjecture 1.1 in semiring theory
Abstract
A lattice-ordered group (an -group) can be naturally viewed as a semiring . We give a full classification of (abelian) -groups which are finitely generated as semirings, by first showing that each such -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 -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 with idempotent addition and provides important information concerning the structure of general finitely generated ideal-simple (commutative) semirings, useful in obtaining further progress…
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.
