Evasive sets, covering by subspaces, and point-hyperplane incidences

DOI10.1007/S00454-023-00601-1MaRDI QIDQ6624199zbMATH OpenFDO

Authors Benny Sudakov, István Tomon

Publication date 25 October 2024

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

codescovering problemsevasive sets

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 2196516 (Why is no real title available?)
• 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
• 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

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)