Structural properties of subadditive families with applications to factorization theory
arXiv:1706.03525 · doi:10.1007/s11856-019-1922-2
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 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 .
22 pp., no figures. Fixed a few typos and updated statements and definitions after realizing that what is proved in the paper is slighly stronger than what claimed in the previous version. To appear in Israel Journal of Mathematics
References in corpus (5)
- Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics
- Systems of sets of lengths: Transfer Krull monoids versus weakly Krull monoids
- Arithmetic of commutative semigroups with a focus on semigroups of ideals and modules
- Long sets of lengths with maximal elasticity
- Products of atoms in Krull monoids
Cited by in corpus (12)
- Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics
- On strongly primary monoids, with a focus on Puiseux monoids
- On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups
- Factorization under Local Finiteness Conditions
- Abstract Factorization Theorems with Applications to Idempotent Factorizations
- Lattices over Bass rings and graph agglomerations
- On the finiteness of certain factorization invariants
- Definite orders with locally free cancellation
- Factorization in monoids and rings
- Factorization in Finitely-Presented Monoids
- On product-one sequences over dihedral groups
- Factorization Theory in Commutative Monoids