pith. sign in

arxiv: 1404.2873 · v2 · pith:W53TH3SJnew · submitted 2014-04-10 · 🧮 math.AC · math.CO· math.NT

The set of minimal distances in Krull monoids

classification 🧮 math.AC math.COmath.NT
keywords deltafinitelengthscdotclassdistanceseveryholds
0
0 comments X
read the original abstract

Let $H$ be a Krull monoid with finite class group $G$. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf 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 \in \mathbb N$ such that all sets of lengths are almost arithmetical multiprogressions with bound $M$ and with difference $d \in \Delta^* (H)$, where $\Delta^* (H)$ denotes the set of minimal distances of $H$. We show that $\max \Delta^* (H) \le \max \{\exp (G)-2, \mathsf 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.