Theory and applications of lattice point methods for binomial ideals
Commutative Algebra
2010-09-16 v1 Computer Science and Game Theory
Combinatorics
Dynamical Systems
Abstract
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 the motivations and background from outside of algebra.
Keywords
Cite
@article{arxiv.1009.2823,
title = {Theory and applications of lattice point methods for binomial ideals},
author = {Ezra Miller},
journal= {arXiv preprint arXiv:1009.2823},
year = {2010}
}
Comments
57 pages, 31 figures; to appear in proceedings of 2009 Abel Symposium (Voss, Norway)