The set of minimal distances in Krull monoids

Abstract

Let H be a Krull monoid with finite class group G. 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. If G is finite, then 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 show that * (H) \ (G)-2, r (G)-1\ and that equality holds if every class of G contains a prime divisor, which holds true for holomorphy rings in global fields.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…