Covering lattice points by subspaces
Number Theory
2024-11-18 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.math/0102030,
title = {Covering lattice points by subspaces},
author = {Imre Bárány and Gergely Harcos and János Pach and Gábor Tardos},
journal= {arXiv preprint arXiv:math/0102030},
year = {2024}
}
Comments
10 pages, AMS-TeX; to appear in Period. Math. Hung.; Corollary to Theorem 3 has been replaced by a weaker version, because the original proof of the Corollary was incorrect. A new proof is provided and Remark 3 has been added