Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 2.1, p. 3, with Definition 1.1 (p. 1), 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.
Setting
Let be a lattice in with (Definition 1.1, p. 1). For the fiber of is
and whenever . Each fiber is a rational polyhedron (Theorem 16.1 of Schrijver's Theory of Linear and Integer Programming, cited on p. 1), so it has finitely many vertices . Let and let be the -th unit vector.
Statement
Proposition 2.1 (p. 3). Let be a fiber of . If is a vertex of and , then is a vertex of its own fiber (the print writes that fiber as ). Equivalently, there is a monomial ideal such that if and only if for a fiber of .
The paper calls the vertex ideal of (p. 1): its standard monomials are exactly the monomials whose exponents are vertices of their fibers, and the union of all , $u\in\mathbf N^n$, is an order ideal of .
Read depth. Claims checked: the statement and Definition 1.1 were read clause by clause on pp. 1 and 3, with the short proof on p. 3.
Proof pointer
Page 3. If were a convex combination of other points of its fiber, adding to each of them would write as a convex combination of other points of .
Dependencies
Definition 1.1 of the same paper; finiteness of the vertex set of a rational polyhedron, cited from Schrijver.
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 uses this proposition to read , for the lattice of integer relations among the elements of , as the statement that the incidence vector of is a vertex of its fiber, which with Definition 4.1 implies that is dissociated; it gives no bound on the size of such .