Universal Counting of Lattice Points in Polytopes

Imre Bárány; Jean-Michel Kantor

Universal Counting of Lattice Points in Polytopes

Combinatorics 2007-05-23 v1 Algebraic Geometry

Authors: Imre Bárány , Jean-Michel Kantor

Abstract

Given a lattice polytope $P$ (with underlying lattice $\lo$ ), the universal counting function $\uu_P(\lo')=|P\cap \lo'|$ is defined on all lattices $\lo'$ containing $\lo$ . Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation $\uu_P=\uu_Q$ .

Keywords

ehrhart theory

Cite

@article{arxiv.math/9905109,
  title  = {Universal Counting of Lattice Points in Polytopes},
  author = {Imre Bárány and Jean-Michel Kantor},
  journal= {arXiv preprint arXiv:math/9905109},
  year   = {2007}
}

Related papers

View all related →