Lattice point methods for combinatorial games
From MaRDI portal
Publication:534200
DOI10.1016/j.aam.2010.10.004zbMath1213.91045arXiv0908.3473MaRDI QIDQ534200
Publication date: 17 May 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.3473
generating function; convex polyhedron; combinatorial game; normal play; affine semigroup; misère play
91A46: Combinatorial games
Related Items
Unnamed Item, Combinatorial games with a pass: A dynamical systems approach, Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials, Algorithms for lattice games, Lattice games without rational strategies, \textsc{polish} -- Let us play the cleaning game, Affine stratifications from finite misère quotients., Decompositions of cellular binomial ideals
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for lattice games
- Decompositions of commutative monoid congruences and binomial ideals.
- Misère quotients for impartial games
- Lectures on Polytopes
- Short rational generating functions for lattice point problems
- Combinatorial Commutative Algebra