2007
DOI: 10.1090/s0002-9939-07-09037-5
|View full text |Cite
|
Sign up to set email alerts
|

Minimal systems of binomial generators and the indispensable complex of a toric ideal

Abstract: Abstract. Let A = {a 1 , . . . , am} ⊂ Z n be a vector configuration and I A ⊂ K[x 1 , . . . , xm] its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of different minimal systems of binomial generators of I A . We also prove that generic toric ideals are generated by indispensable binomials. In the second part we associate to A a simplicial complex ∆ ind(A) . We show that the vertices of ∆ ind(A) correspond to the indispensable monomials of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
81
0
3

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 40 publications
(84 citation statements)
references
References 11 publications
0
81
0
3
Order By: Relevance
“…Consequently there are at least two indispensable binomials with the same G-degree, contradicting Theorem 3.4 in [2]. Recall that the G-degree of a binomial …”
Section: Lemma 31 Assume That Either G Is a Bipartite Graph Or I G mentioning
confidence: 88%
See 1 more Smart Citation
“…Consequently there are at least two indispensable binomials with the same G-degree, contradicting Theorem 3.4 in [2]. Recall that the G-degree of a binomial …”
Section: Lemma 31 Assume That Either G Is a Bipartite Graph Or I G mentioning
confidence: 88%
“…From Proposition 3.1 in [2] we have that the set of indispensable monomials is the unique minimal generating set of N G . The following lemma will be useful in the proof of Theorem 3.2 and Proposition 3.4.…”
Section: It Follows From the Definitions That If δmentioning
confidence: 98%
“…Up to now, it has mainly been addressed for toric and lattice ideals, see [3,4,5,11,12,22] among others. In Section 1, we consider this problem in the case of binomial ideals.…”
Section: Introductionmentioning
confidence: 99%
“…When I := I L is the lattice ideal of L, the equivalence class of u consists precisely of all v such that u − v ∈ L and the I-fibers are finite exactly when L ∩ N n = {0}. In this case, for each I-fiber one can use a graph construction, see [7,4], that determines the I-fibers that appear as invariants associated to any minimal generating set of I. We also note that in [5] the fibers of I L were studied even when L ∩ N n = {0}.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation