1999arXiv (Cornell University)Open access

Universal Counting of Lattice Points in Polytopes

Imre Bárány, Jean‐Michel Kantor

Open full text 1 citations

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$.

Open-access reader

About this research paper

What this paper is about

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$.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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$.

Key concepts: Polytope, Lattice (music), Combinatorics, Mathematics, Physics, Acoustics

Related papers

Back to paper searchBrowse research topicsOriginal source
Universal Counting of Lattice Points in Polytopes — Research Paper | ScholarLens