Universal Counting of Lattice Points in Polytopes
Imre Bárány, Jean-Michel Kantor
Abstract
Given a lattice polytope P (with underlying lattice ), the universal counting function P(')=|P '| is defined on all lattices ' containing . Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation P=Q.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.