Wiki
Wiki

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 L⊆Zn\mathcal L\subseteq\mathbf Z^n with Graver basis Gr⁡L\operatorname{Gr}_{\mathcal L} (Definition 2.5, p. 4, on the Theorem 2.8 page), the product ideal is the monomial ideal

PL=⟨xuxv:u−v∈Gr⁡L⟩.P_{\mathcal L}=\left\langle x^ux^v:u-v\in\operatorname{Gr}_{\mathcal L}\right\rangle .

Here u,v∈Nnu,v\in\mathbf N^n. Every such u,vu,v dominate the positive and negative parts g+,g−g^+,g^- of g=u−vg=u-v, so the same ideal is generated by the monomials xg++g−x^{g^++g^-}, g∈Gr⁡Lg\in\operatorname{Gr}_{\mathcal L}.

The paper records (p. 15) that PL⊆VLP_{\mathcal L}\subseteq V_{\mathcal L}, because every generic initial ideal in⁡ω(IL)\operatorname{in}_\omega(I_{\mathcal L}) contains xux^u or xvx^v whenever u−v∈Lu-v\in\mathcal L, and that the containment can be strict: for L=ker⁡(A)∩Z3\mathcal L=\ker(A)\cap\mathbf Z^3 with A=[3 4 5]A=[3\ 4\ 5], PL=⟨ab2c,a2bc2,a3bc,a4b3,a5c3,b5c4⟩P_{\mathcal L}=\langle ab^2c,a^2bc^2,a^3bc,a^4b^3,a^5c^3,b^5c^4\rangle is strictly contained in VL=⟨ab2c,a2bc,a4b3,a5c3,b5c4⟩V_{\mathcal L}=\langle ab^2c,a^2bc,a^4b^3,a^5c^3,b^5c^4\rangle.

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 LX\mathcal L_X of integer relations among the elements of a finite set X⊂RX\subset\mathbf R, a subset SS is dissociated if and only if the squarefree monomial xSx_S is not in PLXP_{\mathcal L_X}, so the largest dissociated subset has the largest degree of a squarefree standard monomial of PLXP_{\mathcal L_X}. 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.