On zero-sum sequences in .
Let H be a Krull monoid with class group G. Then every nonunit a ∈ H can be written as a finite product of atoms, say . The set (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 ∈ ℕ such that all sets of lengths are almost arithmetical multiprogressions with bound M and with difference d ∈ Δ*(H), where Δ*(H) denotes the set of minimal distances of H. We show that max Δ*(H) ≤ maxexp(G)-2,(G)-1 and that equality holds if every...
We show that in a cyclic group with elements every zero-sumfree sequence with length contains some element of order with high multiplicity.
Arithmetical invariants—such as sets of lengths, catenary and tame degrees—describe the non-uniqueness of factorizations in atomic monoids.We study these arithmetical invariants by the monoid of relations and by presentations of the involved monoids. The abstract results will be applied to numerical monoids and to Krull monoids.
Let be a Krull monoid with finite class group such that every class contains a prime divisor (for example, a ring of integers in an algebraic number field or a holomorphy ring in an algebraic function field). The catenary degree of is the smallest integer with the following property: for each and each two factorizations of , there exist factorizations of such that, for each , arises from by replacing at most atoms from by at most new atoms. Under a very mild condition...
Page 1