The catenary and tame degree of numerical monoids

Chapman, Scott T.; García-Sánchez, Pedro A.; Llena, D.

doi:10.1515/forum.2009.006

Cited by 53 publications

(67 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The present paper will focus on the three closely related invariants, namely the set of distances, the (H) The study of these arithmetical invariants (in settings ranging from numerical monoids to Mori rings with zero-divisors) has attracted a lot of attention in the recent literature (for a sample see [10,9,24,14,25,7,11,8]). Our main focus here will be on Krull monoids with finite class group G such that each class contains a prime divisor.…”

Section: Introduction and Main Resultsmentioning

confidence: 99%

The Catenary Degree of Krull Monoids Ii

Geroldinger

Zhong

2014

J. Aust. Math. Soc.

View full text Add to dashboard Cite

Abstract. Let H be a Krull monoid with finite class group G 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 c(H) of H is the smallest integer N with the following property:for each a ∈ H and each two factorizations z, z ′ of a, there exist factorizations z = z 0 , . . . , z k = z ′ of a such that, for each i ∈ [1, k], z i arises from z i−1 by replacing at most N atoms from z i−1 by at most N new atoms. To exclude trivial cases, suppose that |G| ≥ 3. Then the catenary degree depends only on the class group G and we have c(H) ∈

show abstract

Section: Introduction and Main Resultsmentioning

confidence: 99%

The Catenary Degree of Krull Monoids Ii

Geroldinger

Zhong

2014

J. Aust. Math. Soc.

View full text Add to dashboard Cite

show abstract

“…An algorithm which computes the catenary degree of a finitely generated monoid can be found in [6], and a more specific version for numerical monoids in [5]. We shift from considering particular factorizations to analyzing their lengths.…”

Section: Definitions and Backgroundmentioning

confidence: 99%

On delta sets and their realizable subsets in Krull monoids with cyclic class groups

2014

View full text Add to dashboard Cite

Abstract. Let M be a commutative cancellative monoid. The set ∆(M ), which consists of all positive integers which are distances between consecutive factorization lengths of elements in M , is a widely studied object in the theory of nonunique factorizations. If M is a Krull monoid with cyclic class group of order n ≥ 3, then it is well-known that ∆(M ) ⊆ {1, . . . , n − 2}. Moreover, equality holds for this containment when each class contains a prime divisor from M . In this note, we consider the question of determining which subsets of {1, . . . , n−2} occur as the delta set of an individual element from M . We first prove for x ∈ M that if n − 2 ∈ ∆(x), then ∆(x) = {n − 2} (i.e., not all subsets of {1, . . . , n − 2} can be realized as delta sets of individual elements). We close by proving an Archimedean-type property for delta sets from Krull monoids with finite cyclic class group: for every natural number m, there exist a Krull monoid M with finite cyclic class group such that M has an element x with |∆(x)| ≥ m.

show abstract

“…, a + b with integers a, b such that 0 < b < a. Write r as in formula (4), that is, r = h(r) + is an ordered amenable set, and thus by Theorem 46 an optimal configuration for r = #M . As D(M ∪ {m + a + b − 1}) = D(M ) ∪ {m + a + b − 1}, the set M ∪ {m + a + b − 1} is an optimal configuration of cardinality r + 1, whose shadow fills the whole ground.…”

Section: Corollary 36 the Shadows Of Ordered (S M R)-amenable Setsmentioning

confidence: 99%