Finding Elements With Given Factorization Lengths and Multiplicities

Many algebraic number rings exhibit nonunique factorization of elements into irreducibles. Not only can the irreducibles in the factorizations be different, but the number of irreducibles in the factorizations can also vary. A basic question then is: Which sets can occur as the set of factorization...

Full description

Saved in:
Bibliographic Details
Published in:The American mathematical monthly 2016-11, Vol.123 (9), p.849-870
Main Authors: Baginski, Paul, Rodriguez, Ryan, Schaeffer, George J, She, Yiwei
Format: Article
Language:English
Subjects:
Algebra
Combinatorics
Factorization
Group theory
Mathematical constants
Mathematical problems
Mathematical rings
Mathematical theorems
Monoids
Number theory
Theorems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many algebraic number rings exhibit nonunique factorization of elements into irreducibles. Not only can the irreducibles in the factorizations be different, but the number of irreducibles in the factorizations can also vary. A basic question then is: Which sets can occur as the set of factorization lengths of an element? Moreover, how often can each factorization length occur? While these questions are most pertinent in algebraic number rings, their pertinence extends to Dedekind domains and a broader class of structures called Krull monoids. Surprisingly, for a large subclass of Krull monoids, Kainrath was able to resolve completely the question of which length sets and length multiplicities can be realized. In this article, we explain the context of Kainrath's theorem and give a constructive proof for an important case, namely Krull monoids with infinite nontorsion class group. We also construct length sets in a case not covered by Kainrath's theorem to illustrate the difficulty of the general problem.
ISSN:0002-9890
1930-0972
DOI:10.4169/amer.math.monthly.123.9.849