Papers
Topics
Authors
Recent
Search
2000 character limit reached

The set of minimal distances in Krull monoids

Published 10 Apr 2014 in math.AC, math.CO, and math.NT | (1404.2873v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.