Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Definition 4.1 and the remarks after it, p. 15, of Serkan Hoşten and Diane Maclagan, The vertex ideal of a lattice, arXiv:math/0012197v1 (2000), published in Adv. in Appl. Math. 29 (2002), 521--538, as identified on the source card. Page numbers are those of the arXiv print.
Statement
Definition 4.1 (p. 15). For a lattice with Graver basis (Definition 2.5, p. 4, on the Theorem 2.8 page), the product ideal is the monomial ideal
Here . Every such dominate the positive and negative parts of , so the same ideal is generated by the monomials , .
The paper records (p. 15) that , because every generic initial ideal contains or whenever , and that the containment can be strict: for with , is strictly contained in .
Read depth. Claims checked: the definition, the containment and its one-line justification, and the example were read on p. 15; the example's ideals were not recomputed.
Dependencies
Theorem 2.3 for the containment; Definition 2.5 for the Graver basis.
Bears on
- Problem 963: background only. The paper does not mention dissociated sets, subset sums or the problem. The source card's section on E963 derives from this definition that, for the lattice of integer relations among the elements of a finite set , a subset is dissociated if and only if the squarefree monomial is not in , so the largest dissociated subset has the largest degree of a squarefree standard monomial of . That is a reformulation; the paper gives no bound on that degree, and neither the problem's lower bound nor a counterexample follows from it.