Lattices over Bass rings and graph agglomerations
Abstract
We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring through the factorization theory of the corresponding monoid . Results of Levy-Wiegand and Levy-Odenthal together with a study of the local case yield an explicit description of . The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations--a natural class of monoids serving as combinatorial models for the factorization theory of . As a consequence, the monoid is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of and characterize when is half-factorial. (Factoriality, that is, torsion-free Krull-Remak-Schmidt-Azumaya, is characterized by a theorem of Levy-Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest.
Keywords
Cite
@article{arxiv.2006.10002,
title = {Lattices over Bass rings and graph agglomerations},
author = {Nicholas R. Baeth and Daniel Smertnig},
journal= {arXiv preprint arXiv:2006.10002},
year = {2021}
}
Comments
35 pages; final version