Covering lattice points by subspaces
Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos
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.
Create a lesson
Related papers
Rational points on loxodromic K3 surfaces and complex dynamics
Damián Gvirtz-Chen, Zhizhong Huang, Zhuchao Ji et al.
Ramanujan-type congruences for the smallest parts function
Larry Rolen
Some instances of modularity for residually reducible representations in the mixed case
Luis V. Dieulefait
Classification of torsion of elliptic curves over sextic fields
Filip Najman
A generalization of the Dirichlet approximation theorem for affine actions on the real line
Mohammad Javaheri
On ill-distributed B3 and B4 sets
André Hisatsuga, Rafael Miyazaki, Cosmin Pohoata