Sets of lengths

From MaRDI portal
Publication:4576571




Abstract: Oftentimes the elements of a ring or semigroup H can be written as finite products of irreducible elements, say a=u1cdotldotscdotuk=v1cdotldotscdotvell, where the number of irreducible factors is distinct. The set mathsfL(a)subsetmathbbN of all possible factorization lengths of a is called the set of lengths of a, and the full system mathcalL(H)=mathsfL(a)midainH 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.



Cites work


Cited in
(69)


Describes a project that uses

Uses Software





This page was built for publication: Sets of lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576571)