Evasive sets, covering by subspaces, and point-hyperplane incidences
From MaRDI portal
Publication:6624199
DOI10.1007/S00454-023-00601-1MaRDI QIDQ6624199FDOQ6624199
Authors: Benny Sudakov, István Tomon 
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Configuration theorems in linear incidence geometry (51A20) Combinatorics (05-XX)
Cites Work
- Diophantine approximation
- On extremal problems of graphs and generalized graphs
- Research Problems in Discrete Geometry
- On a problem of K. Zarankiewicz
- Extremal problems in discrete geometry
- Title not available (Why is that?)
- A density version of the Hales-Jewett theorem
- Subspace evasive sets
- Cutting hyperplanes for divide-and-conquer
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- A note on subspace evasive sets
- Lower bounds for incidences with hypersurfaces
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On counting point-hyperplane incidences
- Covering lattice points by subspaces
- Title not available (Why is that?)
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Random algebraic construction of extremal graphs
- An extremal problem for integer sparse recovery
This page was built for publication: Evasive sets, covering by subspaces, and point-hyperplane incidences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624199)
