The Catenary and Tame Degree of Numerical Semigroups

Factorization Invariants in half-Factorial Affine Semigroups

Let NA be the monoid generated byA = {a1, . . . ,an} ⊆ Z.We introduce the homogeneous catenary degree of NA as the smallest N ∈ N with the following property: for each a ∈ NA and any two factorizations u,v of a, there exists factorizations u = w1, . . . ,wt = v of a such that, for every k, d(wk,wk+1) ≤ N, where d is the usual distance between factorizations, and the length of wk, |wk|, is less ...

The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids

A. Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S )) and the tame degree of S (denoted t(S )) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we ...

The catenary and tame degree in finitely generated commutative cancellative monoids

Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S)) and the tame degree of S (denoted t(S)) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we describe met...

Decidability and Tameness in the Theory of Finite Semigroups

On Factorization Invariants and Hilbert Functions

Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical semigroups (additive subsemigroups of the natural numbers), several factorization invariants are known to admit predictable behavior for sufficiently large semigrou...