Coprime Ehrhart Theory and Counting Free Segments
From MaRDI portal
Publication:6115145
Polyhedra and polytopes; regular figures, division of spaces (51M20) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Abstract: A lattice polytope is "free" (or "empty") if its vertices are the only lattice points it contains. In the context of valuation theory, Klain (1999) proposed to study the functions that count the number of free polytopes in with vertices. For , this is the famous Ehrhart polynomial. For , the computation is likely impossible and for computationally challenging. In this paper, we develop a theory of coprime Ehrhart functions, that count lattice points with relatively prime coordinates, and use it to compute for unimodular simplices. We show that the coprime Ehrhart function can be explicitly determined from the Ehrhart polynomial and we give some applications to combinatorial counting.
Recommendations
This page was built for publication: Coprime Ehrhart Theory and Counting Free Segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115145)