Indispensable binomials in semigroup ideals

DOI10.1090/S0002-9939-2010-10456-2MaRDI QIDQ3065700zbMATH OpenOpenAlexFDO

Authors Ignacio Ojeda Martínez de Castilla, A. Vigneron-Tenorio

Publication date 6 January 2011

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.1030

zbMATH Keywords

toric idealsemigroup idealindispensable binomialminimal system of generatorsindispensable monomial

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Graded rings and modules (associative rings and algebras) (16W50)

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.

Recommendations

• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Minimal systems of generators for ideals of semigroups
• Commutative ideal theory without finiteness conditions: Completely irreducible ideals
• Binomial fibers and indispensable binomials
• Binomial semigroups

Cites work

• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 1438385 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Algebraic algorithms for sampling from conditional distributions
• Binomial ideals
• Combinatoric of syzygies for semigroup algebras
• Computing toric ideals
• Examples of Generic Lattice Ideals of Codimension 3
• Generators and relations of abelian semigroups and semigroup rings
• Generic lattice ideals
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Indispensable monomials of toric ideals and Markov bases
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Minimal systems of generators for ideals of semigroups
• On Lawrence semigroups
• On simple \({\mathcal A}\)-multigraded minimal resolutions
• On the hull resolution of an affine monomial curve
• On the toric algebra of graphical models
• Simplicial complexes and minimal free resolution of monomial algebras
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Syzygies of codimension 2 lattice ideals

Cited in

(16)

• Combinatorial properties and characterization of glued semigroups
• On decomposable semigroups and applications.
• Simplicial complexes and minimal free resolution of monomial algebras
• Skew polynomial rings with binomial relations
• Matroid toric ideals: complete intersection, minors, and minimal systems of generators
• Critical binomial ideals of Northcott type
• Indispensable monomials of toric ideals and Markov bases
• On \(p\)-Frobenius of affine semigroups
• Binomial fibers and indispensable binomials
• On Lawrence semigroups
• On the strongly robust property of toric ideals
• The Frobenius problem for generalized repunit numerical semigroups
• A semigroup defining the Gröbner degeneration of a toric ideal
• Gluing semigroups and strongly indispensable free resolutions
• Unimodular binary hierarchical models
• Minimal generating sets of lattice ideals

This page was built for publication: Indispensable binomials in semigroup ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065700)