The set of minimal distances in Krull monoids
Commutative Algebra
2019-07-09 v2 Combinatorics
Number Theory
Abstract
Let be a Krull monoid with finite class group . Then every non-unit can be written as a finite product of atoms, say . The set of all possible factorization lengths is called the set of lengths of . If is finite, then there is a constant such that all sets of lengths are almost arithmetical multiprogressions with bound and with difference , where denotes the set of minimal distances of . We show that and that equality holds if every class of contains a prime divisor, which holds true for holomorphy rings in global fields.
Cite
@article{arxiv.1404.2873,
title = {The set of minimal distances in Krull monoids},
author = {Alfred Geroldinger and Qinghai Zhong},
journal= {arXiv preprint arXiv:1404.2873},
year = {2019}
}