Covering lattice points by subspaces and counting point-hyperplane incidences
From MaRDI portal
Publication:1716001
DOI10.1007/s00454-018-9970-7zbMath1407.52017OpenAlexW3014789549MaRDI QIDQ1716001
Josef Cibulka, Pavel Valtr, Martin Balko
Publication date: 29 January 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-018-9970-7
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Erd?s problems and related topics of discrete geometry (52C10) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items (6)
On topological graphs with at most four crossings per edge ⋮ The constant of point-line incidence constructions ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ An extremal problem for integer sparse recovery ⋮ A general incidence bound in \(\mathbb{R}^d\) ⋮ The largest complete bipartite subgraph in point-hyperplane incidence graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems in discrete geometry
- A guided tour of Chernoff bounds
- Cutting hyperplanes for divide-and-conquer
- Graphs drawn with few crossings per edge
- New bounds in some transference theorems in the geometry of numbers
- New lower bounds for Hopcroft's problem
- On counting point-hyperplane incidences
- On topological graphs with at most four crossings per edge
- A semi-algebraic version of Zarankiewicz's problem
- Lower bounds for incidences with hypersurfaces
- Research Problems in Discrete Geometry
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- A theorem on transfer for convex bodies
- On a Problem of Heilbronn
- On Sets of Distances of n Points
- Covering lattice points by subspaces
This page was built for publication: Covering lattice points by subspaces and counting point-hyperplane incidences
