Universal Counting of Lattice Points in Polytopes
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.