Covering lattice points by subspaces
From MaRDI portal
Abstract: We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional subspaces induced by the lattice points in a large n-dimensional ball centered at the origin.
Recommendations
- scientific article; zbMATH DE number 1054789
- Covering convex bodies by cylinders and lattice points by flats
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Economical coverings of sets of lattice points
Cited in
(15)- Economical coverings of sets of lattice points
- Convex cones, integral zonotopes, limit shape
- Covering lattice points by subspaces and counting point-hyperplane incidences
- On counting point-hyperplane incidences
- On the linear span of lattice points in a parallelepiped
- Integral points of small height outside of a hypersurface
- No l Grid-Points in Spaces of Small Dimension
- scientific article; zbMATH DE number 739008 (Why is no real title available?)
- scientific article; zbMATH DE number 1054789 (Why is no real title available?)
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Coloring lines and Delaunay graphs with respect to boxes
- Minkowski's successive minima in convex and discrete geometry
- Evasive sets, covering by subspaces, and point-hyperplane incidences
- On subsets of lattice cubes avoiding affine and spherical degeneracies
- Covering convex bodies by cylinders and lattice points by flats
This page was built for publication: Covering lattice points by subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948353)