Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the number of integer points in translated and expanded polyhedra (1805.03685v2)

Published 9 May 2018 in math.CO and cs.CC

Abstract: We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in $\mathbb{R}6$ is NP-hard. We apply this result to show that given a rational convex polytope $P \subset \mathbb{R}6$, finding the largest integer $t$ s.t. the expansion $tP$ contains fewer than $k$ integer points is also NP-hard. We conclude that the Ehrhart quasi-polynomials of rational polytopes can have arbitrary fluctuations.

Citations (1)

Summary

We haven't generated a summary for this paper yet.