# Theory and applications of lattice point methods for binomial ideals

@article{Miller2010TheoryAA, title={Theory and applications of lattice point methods for binomial ideals}, author={Ezra Miller}, journal={ArXiv}, year={2010}, volume={abs/1009.2823} }

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose motivations come from outside of commutative algebra: hypergeometric systems, combinatorial game theory, and chemical dynamics. The exposition is aimed at students and researchers in algebra; it includes many examples, open problems, and elementary introductions to…

## 16 Citations

### Decompositions of cellular binomial ideals

- MathematicsJ. Lond. Math. Soc.
- 2016

Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels, giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically…

### Parity binomial edge ideals

- MathematicsJournal of Algebraic Combinatorics
- 2015

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gröbner bases and are radical if and only if the graph is bipartite…

### Decompositions of commutative monoid congruences and binomial ideals

- Mathematics
- 2014

Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of…

### A Geometric Approach to the Global Attractor Conjecture

- MathematicsSIAM J. Appl. Dyn. Syst.
- 2014

The main result states that the global attractor conjecture holds for complex-balanced systems that are strongly endotactic: every trajectory with positive initial condition converges to the unique positive equilibrium allowed by conservation laws.

### Minimal generating sets of lattice ideals

- Mathematics
- 2017

Let $$L\subset \mathbb {Z}^n$$L⊂Zn be a lattice and $$I_L=\langle x^{\mathbf {u}}-x^{\mathbf {v}}:\ {\mathbf {u}}-{\mathbf {v}}\in L\rangle $$IL=⟨xu-xv:u-v∈L⟩ be the corresponding lattice ideal in…

### A Stochastic Molecular Scheme for an Artificial Cell to Infer Its Environment from Partial Observations

- Computer ScienceDNA
- 2017

This paper shows how to perform a statistical operation known as Information Projection or E projection with stochastic mass-action kinetics, which encodes desired conditional distributions as the equilibrium distributions of reaction systems.

### Dawson’s chess revisited

- Computer Science
- 2013

In this paper we prove that in a Quasi-Dawson’s Chess (a restricted version of Dawson’s Chess) playing on a 3 × d board, the first player is loser if and only if d (mod)5 = 1 or d (mod)5 = 2.…

### DNA Computing and Molecular Programming

- Computer ScienceLecture Notes in Computer Science
- 2018

CRN++ is introduced, a new language for programming deterministic (mass-action) chemical kinetics to perform computation and can be easily extended to support new commands or chemical reaction implementations, and thus provides a foundation for developing more robust and practical molecular programs.

## References

SHOWING 1-10 OF 72 REFERENCES

### Combinatorics of binomial primary decomposition

- Mathematics
- 2008

An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free…

### Binomial Ideals

- Mathematics
- 1994

: We investigate the structure of ideals generated by binomials (poly-nomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many…

### Primary Decomposition of Lattice Basis Ideals

- MathematicsJ. Symb. Comput.
- 2000

All minimal primes in the 3 × n case are determined, and faster ways of computing a generating set for the associated toric ideal from a lattice basis ideal are presented.

### Alexander Duality for Monomial Ideals and Their Resolutions

- Mathematics
- 1998

Alexander duality has, in the past, made its way into commutative algebra through Stanley-Reisner rings of simplicial complexes. This has the disadvantage that one is limited to squarefree monomial…

### Combinatorial Commutative Algebra

- Mathematics
- 2004

Monomial Ideals.- Squarefree monomial ideals.- Borel-fixed monomial ideals.- Three-dimensional staircases.- Cellular resolutions.- Alexander duality.- Generic monomial ideals.- Toric Algebra.-…

### Introduction to commutative algebra

- Mathematics
- 1969

* Introduction * Rings and Ideals * Modules * Rings and Modules of Fractions * Primary Decomposition * Integral Dependence and Valuations * Chain Conditions * Noetherian Rings * Artin Rings *…

### Short rational generating functions for lattice point problems

- Mathematics
- 2002

Abstract. We prove that for any ﬁxed d the generating function of the projectionof the set of integer points in a rational d-dimensional polytope can be computed inpolynomial time. As a corollary, we…

### Cohen-Macaulay quotients of normal semigroup rings via irreducible resolutions

- Mathematics
- 2001

Every quotient R/I of a semigroup ring R by a radical monomial ideal I has a unique minimal injective-like resolution by direct sums of quotients of R modulo prime monomial ideals. The quotient R/I…

### Algorithms for graded injective resolutions and local cohomology over semigroup rings

- MathematicsJ. Symb. Comput.
- 2005

### Affine stratifications from finite misère quotients

- MathematicsArXiv
- 2010

The motivating consequence of the main result is a special case of a conjecture due to Guo and the author on the existence of affine stratifications for (the set of winning positions of) any lattice game.