REALISABLE SETS OF CATENARY DEGREES OF NUMERICAL MONOIDS
From MaRDI portal
Abstract: The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of occur as the set of catenary degrees of a numerical monoid (i.e., a co-finite, additive submonoid of ). In particular, we show that, with one exception, every finite subset of that can possibly occur as the set of catenary degrees of some atomic monoid is actually achieved by a numerical monoid.
Recommendations
- The catenary and tame degree of numerical monoids
- The catenary degrees of elements in numerical monoids generated by arithmetic sequences
- On the set of catenary degrees of finitely generated cancellative commutative monoids
- A realization theorem for sets of lengths in numerical monoids
- The monotone catenary degree of monoids of ideals
- The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences.
- The monotone catenary degree of Krull monoids.
- The catenary degree of Krull monoids. I
- The catenary and tame degrees on a numerical monoid are eventually periodic
- Realization of monoids on sets
Cites work
- A realization theorem for sets of distances
- Delta sets for symmetric numerical semigroups with embedding dimension three
- Factorization invariants in half-factorial affine semigroups.
- Minimal presentations for monoids with the ascending chain condition on principal ideals.
- Minimal relations and catenary degrees in Krull monoids
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- Numerical semigroups.
- numericalsgps, a GAP package for numerical semigroups
- On the set of catenary degrees of finitely generated cancellative commutative monoids
- The catenary and tame degree in finitely generated commutative cancellative monoids.
- The realization problem for delta sets of numerical semigroups
Cited in
(15)- Systems of sets of lengths of Puiseux monoids
- A realization theorem for sets of lengths in numerical monoids
- On strongly primary monoids, with a focus on Puiseux monoids
- Factorization theory in commutative monoids
- Sets of arithmetical invariants in transfer Krull monoids
- On the set of catenary degrees of finitely generated cancellative commutative monoids
- The catenary and tame degrees on a numerical monoid are eventually periodic
- Factorization invariants in numerical monoids
- LIFTINGS OF A MONOMIAL CURVE
- Distances between factorizations in the Chicken McNugget monoid
- On product-one sequences over dihedral groups
- On monoids of ideals of orders in quadratic number fields
- On the arithmetic of stable domains
- Factorization invariants of Puiseux monoids generated by geometric sequences
- scientific article; zbMATH DE number 7688262 (Why is no real title available?)
This page was built for publication: REALISABLE SETS OF CATENARY DEGREES OF NUMERICAL MONOIDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607009)