• Home
  • Search
  • Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences
  • Open Access IconOpen Access
  • Cite Icon13
  • https://doi.org/10.1007/s00454-018-9970-7Copy DOI Icon

Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Let d and k be integers with \(1 \le k \le d-1\). Let \(\Lambda \) be a d-dimensional lattice and let K be a d-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of k-dimensional linear subspaces needed to cover all points in \(\Lambda \cap K\). In particular, our results imply that the minimum number of k-dimensional linear subspaces needed to cover the d-dimensional \(n \times \cdots \times n\) grid is at least \(\Omega \bigl (n^{d(d-k)/(d-1)-\varepsilon }\bigr )\) and at most \(O\bigl (n^{d(d-k)/(d-1)}\bigr )\), where \(\varepsilon >0\) is an arbitrarily small constant. This nearly settles a problem mentioned in the book by Brass et al. (Research problems in discrete geometry, Springer, New York, 2005). We also find tight bounds for the minimum number of k-dimensional affine subspaces needed to cover \(\Lambda \cap K\). We use these new results to improve the best known lower bound for the maximum number of point–hyperplane incidences by Brass and Knauer (Comput Geom 25(1–2):13–20, 2003). For \(d \ge 3\) and \(\varepsilon \in (0,1)\), we show that there is an integer \(r=r(d,\varepsilon )\) such that for all positive integers n, m the following statement is true. There is a set of n points in \(\mathbb {R}^d\) and an arrangement of m hyperplanes in \(\mathbb {R}^d\) with no \(K_{r,r}\) in their incidence graph and with at least \(\Omega \bigl ((mn)^{1-(2d+3)/((d+2)(d+3)) - \varepsilon }\bigr )\) incidences if d is odd and \(\Omega \bigl ((mn)^{1-(2d^2+d-2)/((d+2)(d^2+2d-2)) -\varepsilon }\bigr )\) incidences if d is even.

Loading PDF

Similar Papers
  • Research Article
  • Citations10

Covering a set with homothets of a convex body

  • Mar 07, 2009
  • Positivity
  • Márton Naszódi
  • Research Article
  • Citations12

Discrete Differential Geometry

  • Dec 31, 2006
  • Oberwolfach Reports
  • Alexander I Bobenko +3
  • Single Book
  • Citations803

Research Problems in Discrete Geometry

  • Jan 01, 2005
  • János Pach +2
  • Research Article
  • Citations143

Minimal surfaces from circle patterns: Geometry from combinatorics

  • Jul 01, 2006
  • Annals of Mathematics
  • Alexander Bobenko +2
  • Research Article
  • Citations40

A semidefinite programming hierarchy for packing problems in discrete geometry

  • Nov 28, 2014
  • Mathematical Programming
  • David De Laat +1
  • Research Article
  • Citations1

Empty triangles in complete topological graphs

  • Nov 01, 2013
  • Electronic Notes in Discrete Mathematics
  • Andres J Ruiz-Vargas
  • Book Chapter
  • Citations11

CHAPTER 24 - Some Problems in Combinatorial Geometry

  • Jan 01, 1973
  • A Survey of Combinatorial Theory
  • Douglas Kelly +1
  • Book Chapter
  • Citations5

Subspace Approximation with Outliers

  • Jan 01, 2020
  • Amit Deshpande +1
  • PDF
  • Research Article
  • Citations12

Rank bounds for design matrices with block entries and geometric applications

  • Mar 12, 2018
  • Discrete Analysis
  • Zeev Dvir +3
  • Book Chapter

Solution of the Basic Problems of Discrete Geometry on the Plane

  • Jan 01, 2000
  • S S Ryshkov +2
  • PDF
  • Research Article

Computer simulation of the arrangement of pears in the dryer

  • Apr 19, 2024
  • Informatics in school
  • P I Sovertkov +1
  • Research Article
  • Citations12

Standing waves in the FitzHugh-Nagumo system and a problem in combinatorial geometry

  • Mar 31, 2006
  • Mathematische Zeitschrift
  • Juncheng Wei +1
  • Research Article
  • Citations10

On Levels in Arrangements of Surfaces in Three Dimensions

  • Apr 27, 2012
  • Discrete & Computational Geometry
  • Timothy M Chan
  • Research Article
  • Citations8

Extremal problems for convex geometric hypergraphs and ordered hypergraphs

  • Aug 10, 2020
  • Canadian Journal of Mathematics
  • Zoltán Füredi +4
  • Conference Article
  • Citations20

Enumerating order types for small sets with applications

  • Jun 01, 2001
  • Oswin Aichholzer +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.