Lattice point methods for combinatorial games

DOI10.1016/j.aam.2010.10.004zbMath1213.91045arXiv0908.3473OpenAlexW2069859193MaRDI QIDQ534200

Ezra Miller, Alan Guo

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

zbMATH Keywords

generating functionconvex polyhedroncombinatorial gamenormal playaffine semigroupmisère play

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (8)

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials ⋮ Algorithms for lattice games ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Affine stratifications from finite misère quotients. ⋮ Lattice games without rational strategies ⋮ Unnamed Item ⋮ Decompositions of cellular binomial ideals ⋮ Combinatorial games with a pass: A dynamical systems approach

Uses Software

• Binomials.m2

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice point methods for combinatorial games