Structural properties of subadditive families with applications to factorization theory
From MaRDI portal
Publication:6287750
DOI10.1007/S11856-019-1922-2arXiv1706.03525WikidataQ127281771 ScholiaQ127281771MaRDI QIDQ6287750FDOQ6287750
Authors: Salvatore Tringali
Publication date: 12 June 2017
Abstract: Let be a multiplicatively written monoid. Given , we denote by the set of all such that for some atoms . The sets are one of the most fundamental invariants studied in the theory of non-unique factorization, and understanding their structure is a basic problem in the field: In particular, it is known that, in many cases of interest, these sets are almost arithmetic progressions with the same difference and bound for all large , namely, satisfies the Structure Theorem for Unions. The present paper improves the current state of the art on this problem. More precisely, we show that, under mild assumptions on , not only does the Structure Theorem for Unions hold, but there also exists such that, for every , the sequences �igl((mathscr U_k-infmathscr U_k)cap[![0,M]!]�igr)_{kge 1} quad ext{and}quad �igl((supmathscr U_k-mathscr U_k)cap[![0,M]!]�igr)_{kge 1} are -periodic from some point on. The result applies, e.g., to (the multiplicative monoid of) all commutative Krull domains (e.g., Dedekind domains) with finite class group; a variety of weakly Krull commutative domains (including all orders in number fields with finite elasticity); some maximal orders in central simple algebras over global fields; and all numerical monoids. Large parts of the proofs are worked out in a "purely additive model", by inquiring into the properties of what we call a subadditive family, i.e., a collection of subsets of such that, for all , there is with .
This page was built for publication: Structural properties of subadditive families with applications to factorization theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287750)