Uniquely presented finitely generated commutative monoids

Abstract

A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be uniquely presented. We use the concept of gluing to construct commutative monoids with this property. Finally for some relevant families of numerical semigroups we describe the elements that are uniquely presented.

13 pages, typos corrected, references updated

References in corpus (3)

• Indispensable monomials of toric ideals and Markov bases
• Simplicial complexes and minimal free resolution of monomial algebras
• Indispensable binomials in semigroup ideals

Cited by in corpus (14)

• numericalsgps, a GAP package for numerical semigroups
• The Realization Problem for Delta Sets of Numerical Semigroups
• Affine semigroups having a unique Betti element
• The Frobenius number for sequences of triangular and tetrahedral numbers
• Factorization invariants in half-factorial affine semigroups
• Numerical semigroups on compound sequences
• An indispensable classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k}) $
• On Pseudo Symmetric Monomial Curves
• On the decomposable semigroups and applications
• Gluing semigroups and strongly indispensable free resolutions
• Combinatorial properties and characterization of glued semigroups
• Isolated factorizations and their applications in simplicial affine semigroups
• Liftings of a monomial curve
• Atomicity and Factorization of Puiseux Monoids