Displaying similar documents to “Elasticity of factorizations in atomic monoids and integral domains”

Factorization properties of Krull monoids with infinite class group

Wolfgang Hassler (2002)

Colloquium Mathematicae

Similarity:

For a non-unit a of an atomic monoid H we call L H ( a ) = k ∈ ℕ | a = u ₁ . . . u k w i t h i r r e d u c i b l e u i ∈ H the set of lengths of a. Let H be a Krull monoid with infinite divisor class group such that each divisor class is the sum of a bounded number of prime divisor classes of H. We investigate factorization properties of H and show that H has sets of lengths containing large gaps. Finally we apply this result to finitely generated algebras over perfect fields with infinite divisor class group.

Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids

Víctor Blanco, Pedro A. García-Sánchez, Alfred Geroldinger (2010)

Actes des rencontres du CIRM

Similarity:

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.

Arithmetic of non-principal orders in algebraic number fields

Andreas Philipp (2010)

Actes des rencontres du CIRM

Similarity:

Let R be an order in an algebraic number field. If R is a principal order, then many explicit results on its arithmetic are available. Among others, R is half-factorial if and only if the class group of R has at most two elements. Much less is known for non-principal orders. Using a new semigroup theoretical approach, we study half-factoriality and further arithmetical properties for non-principal orders in algebraic number fields.

The set of minimal distances in Krull monoids

Alfred Geroldinger, Qinghai Zhong (2016)

Acta Arithmetica

Similarity:

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 a = u 1 · . . . · u k . 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...