Universal Counting of Lattice Points in Polytopes
classification
🧮 math.CO
math.AG
keywords
latticecountingpolytopesuniversalconcerningcontainingdefinedehrhart
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.