MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Covering lattice points by subspaces [1 citations — 0 self]

Download:
Download as a PDF
by Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos
Period. Math. Hungar
http://www.math.princeton.edu/~gharcos/racs0912.pdf
Add To MetaCart

Abstract:

Abstract. We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body C, symmetric about the origin 0. This enables us to prove the following statement, which settles a problem of G. Halász. The maximum number of n-wise linearly independent lattice points in the n-dimensional ball rB n of radius r around 0 is O(r n/(n−1)). This bound cannot be improved. We also show that the order of magnitude of the number of different (n − 1)-dimensional subspaces induced by the lattice points in rB n is r n(n−1).

Citations

35 On the number of real roots of a random algebraic equation – Littlewood, Offord - 1943
30 On a lemma of Littlewood and – Erdös - 1945
24 Weyl groups, the hard Lefschetz theorem, and the Sperner property – Stanley - 1980
17 Estimates for the concentration function of combinatorial number theory and probability – Halász - 1977
13 On a conjecture of Erdős and a stronger form of Sperner’s theorem – Katona - 1966
13 On a lemma of Littlewood and Offord on the distribution of certain sums – Kleitman - 1965
13 On a problem of – Roth - 1951
6 Inequalites for convex bodies and polar reciprocal lattices – Banaszczyk - 1995
6 Ein Ubertragungsprinzip fur konvexe Korper – Mahler - 1939
5 Über ein Problem von Erdős und – Sárközy, Szemerédi - 1965
4 On the distribution of sums of vectors in general position – Griggs, Rote - 1997
2 On the number of lattice hyperplanes which are needed to cover the lattice points of a convex body, Intuitive geometry – Bezdek, Hausel - 1991
2 Covering the lattice points of a convex body with ane subspaces, Intuitive geometry (Budapest – Talata - 1995