2000 character limit reached
A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions
Published 11 Jan 2019 in math.AC and math.NT | (1901.03506v2)
Abstract: Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. Then sets of lengths in H have a well-defined structure which just depends on the class group G. With methods from additive combinatorics we establish a characterization of those class groups G guaranteeing that all sets of lengths are (almost) arithmetical progressions.
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.