Sets of Lengths

Abstract

Oftentimes the elements of a ring or semigroup H can be written as finite products of irreducible elements, say a=u1 · … · uk = v1 · … · v, where the number of irreducible factors is distinct. The set L (a) ⊂ N of all possible factorization lengths of a is called the set of lengths of a, and the full system L (H) = \ L (a) a ∈ H \ is a well-studied means of describing the non-uniqueness of factorizations of H. We provide a friendly introduction, which is largely self-contained, to what is known about systems of sets of lengths for rings of integers of algebraic number fields and for transfer Krull monoids of finite type as their generalization.

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…