ON DELTA SETS OF NUMERICAL MONOIDS

By C. Bowles, Scott T. Chapman, Nathan Kaplan, Daniel Reiser. 2006

88 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/a3620480104c822c1880a3d573f310a7dc6a30ca

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. Felix Gotti
2. Nathan Kaplan
3. Scott T. Chapman
4. David Llena
5. José Carlos Rosales
6. Marly Gotti
7. Alfred Geroldinger
8. Wolfgang A. Schmid

In Computational Theory and Mathematics

1. Nathan Kaplan
2. Felix Gotti
3. José Carlos Rosales
4. Scott T. Chapman
5. Marly Gotti
6. Alfred Geroldinger
7. Wolfgang A. Schmid
8. Florian Kainrath

Citations in the corpus

• The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids (2006, background): “While consideration of the finitely generated case my seem to be a strong restriction, many classes of monoids, such as numerical monoids (see [1]), block monoids over finite abelian groups (see [15]), and Diophantine monoids (see [4]) can be studied under this assumption.”
• Factorization invariants of Puiseux monoids generated by geometric sequences (2019, background): “(see [6, 13] and references therein).”
• On the delta set and the Betti elements of a BF-monoid (2012, background): “In particular, the results of [5] indicate that even if S is 3-generated, then the structure of (S) may be extremely complex (see for example, [5, Corollary 4.”
• Delta sets of numerical monoids are eventually periodic (2009, background): “In this paper, we expand on the study of ∆(M) begun in [2] and [3] by showing that the delta sets of a numerical monoid are eventually periodic.”