Indispensable binomials in semigroup ideals

Abstract

In this paper, we deal with the problem of uniqueness of minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for uniqueness of such minimal system of generators. These conditions come from the study and combinatorial description of the so-called indispensable binomials in the semigroup ideal.

11 pages. This paper was initially presented at the II Iberian Mathematical Meeting (http://imm2.unex.es). To appear in the Proc. Amer. Math. Soc

References in corpus (3)

• On the toric algebra of graphical models
• Indispensable monomials of toric ideals and Markov bases
• Simplicial complexes and minimal free resolution of monomial algebras

Cited by in corpus (7)

• Uniquely presented finitely generated commutative monoids
• An indispensable classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k}) $
• Minimal Generating Sets of Lattice Ideals
• Combinatorial properties and characterization of glued semigroups
• Gluing semigroups and strongly indispensable free resolutions
• On the decomposable semigroups and applications
• An upper bound for the GSV-index of a foliation