2000 character limit reached
The system of sets of lengths in Krull monoids under set addition
Published 8 Jul 2014 in math.AC and math.CO | (1407.1967v3)
Abstract: Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization lengths is the set of lengths of $a$. We consider the system $\mathcal L (H) = { \mathsf L (a) \mid a \in H }$ of all sets of lengths, and we characterize (in terms of the class group $G$) when $\mathcal L (H)$ is additively closed under set addition.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.