Uniquely presented finitely generated commutative monoids

By P. García-Sánchez, I. Ojeda. 2009

52 citations recorded by the source corpus.

A finitely generated commutative monoid is uniquely presented if it has a unique 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.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/7bfb5ac7ac053595ef7323b0ccf3a9e549376ee9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. David Llena
2. Scott T. Chapman
3. Alfred Geroldinger
4. Wolfgang A. Schmid
5. Florian Kainrath
6. W. Hassler

In Computational Theory and Mathematics

1. Scott T. Chapman
2. Alfred Geroldinger
3. Wolfgang A. Schmid
4. Florian Kainrath
5. W. Hassler

Citations in the corpus

• On the delta set and the Betti elements of a BF-monoid (2012, background): “Monoids having a unique minimal presentation have drawn the attention of many researchers in the last decade (see for instance [12]).”