Papers
Topics
Authors
Recent
Search
2000 character limit reached

On lattice illumination of smooth convex bodies

Published 17 Jan 2025 in math.MG, math.CO, and math.NT | (2501.10570v2)

Abstract: The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb Rn$ can be illuminated by a set of no more than $2n$ points. If $K$ has smooth boundary, it is known that $n+1$ points are necessary and sufficient. We consider an effective variant of the illumination problem for bodies with smooth boundary, where the illuminating set is restricted to points of a lattice and prove the existence of such a set close to $K$ with an explicit bound on the maximal distance. We produce improved bounds on this distance for certain classes of lattices, exhibiting additional symmetry or near-orthogonality properties. Our approach is based on the geometry of numbers.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.