Sets of minimal distances and characterizations of class groups of Krull monoids
Abstract
Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then every non-unit a ∈ H can be written as a finite product of atoms, say a=u1 · … · uk. The set L (a) of all possible factorization lengths k is called the set of lengths of a. There is a constant M ∈ N such that all sets of lengths are almost arithmetical multiprogressions with bound M and with difference d ∈ * (H), where * (H) denotes the set of minimal distances of H. We study the structure of * (H) and establish a characterization when *(H) is an interval. The system L (H) = \ L (a) a ∈ H \ of all sets of lengths depends only on the class group G, and a standing conjecture states that conversely the system L (H) is characteristic for the class group. We confirm this conjecture (among others) if the class group is isomorphic to Cnr with r,n ∈ N and *(H) is not an interval.