Factorization Theory in Commutative Monoids

Abstract

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and the multiplicative monoids of domains (including Krull domains, rings of integer-valued polynomials, orders in algebraic number fields) and of their ideals. We offer examples for all these classes of monoids and discuss their main arithmetical finiteness properties. These describe the structure of their sets of lengths, of the unions of sets of lengths, and their catenary degrees. We also provide examples where these finiteness properties do not hold.

Semigroup Forum, to appear

References in corpus (9)

• Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics
• On strongly primary monoids, with a focus on Puiseux monoids
• Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
• Systems of sets of lengths: Transfer Krull monoids versus weakly Krull monoids
• Structural properties of subadditive families with applications to factorization theory
• Sets of Arithmetical Invariants in Transfer Krull Monoids
• An asymptotically tight bound for the Davenport constant
• On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups
• Factorizations of polynomials with integral non-negative coefficients