Structural properties of subadditive families with applications to factorization theory
Abstract
Let H be a multiplicatively written monoid. Given k∈ N+, we denote by Uk the set of all ∈ N+ such that a1·s ak=b1·s b for some atoms a1,…,ak,b1,…,b∈ H. The sets Uk 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 k, namely, H 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 H, not only does the Structure Theorem for Unions hold, but there also exists μ∈ N+ such that, for every M∈ N, the sequences (( Uk-∈f Uk)[\![0,M]\!])k 1 (( Uk- Uk)[\![0,M]\!])k 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 L of subsets of N such that, for all L1,L2∈ L, there is L∈ L with L1+L2⊂eq L.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.