Evasive sets, covering by subspaces, and point-hyperplane incidences
From MaRDI portal
(Redirected from Publication:6624199)
Evasive sets, covering by subspaces, and point-hyperplane incidences (scientific article; zbMATH DE number 7931819)
Evasive sets, covering by subspaces, and point-hyperplane incidences (scientific article; zbMATH DE number 7931819)
Cites work
- A density version of the Hales-Jewett theorem
- A note on subspace evasive sets
- An extremal problem for integer sparse recovery
- Covering lattice points by subspaces
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Cutting hyperplanes for divide-and-conquer
- Diophantine approximation
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 2196516 (Why is no real title available?)
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- Lower bounds for incidences with hypersurfaces
- On a problem of K. Zarankiewicz
- On counting point-hyperplane incidences
- On extremal problems of graphs and generalized graphs
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Random algebraic construction of extremal graphs
- Research Problems in Discrete Geometry
- Subspace evasive sets
Cited in
(4)
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)
