Incidence Theorems and Their Applications

DOI10.1561/0400000056zbMath1278.68012arXiv1208.5073OpenAlexW4205208713MaRDI QIDQ2871574

Zeev Dvir

Publication date: 8 January 2014

Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5073

zbMATH Keywords

polynomial interpolationadditive combinatoricsrandomness extractorsconfiguration of pointsarrangements of linesapplications in combinatoricscounting incidencesErdős' distance problemKaskeya-type problemslocally correctable error-correcting codesmaximum number of incidencesmultisource extractorsSylvester-Gallai-type problemsSzermeredi-Trotter theorem

Mathematics Subject Classification ID

Related Items (25)

Joints of varieties ⋮ A crossing lemma for Jordan curves ⋮ The Multivariate Schwartz--Zippel Lemma ⋮ On the size of Kakeya sets in finite vector spaces ⋮ A pseudoline counterexample to the strong Dirac conjecture ⋮ Incidence bounds on multijoints and generic joints ⋮ Joints tightened ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof ⋮ Non-transversal multilinear duality and joints ⋮ The polynomial method over varieties ⋮ New restriction estimates for the 3-d paraboloid over finite fields ⋮ Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory ⋮ Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants ⋮ Colouring multijoints ⋮ Planar point sets determine many pairwise crossing segments ⋮ On rich and poor directions determined by a subset of a finite plane ⋮ Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ Incidence Bounds for Block Designs ⋮ A point-conic incidence bound and applications over \(\mathbb{F}_p\) ⋮ Bounds of trilinear and quadrilinear exponential sums ⋮ Variations on the Sum-Product Problem ⋮ An explicit classical strategy for winning a ${\mathrm{CHSH}}_{q}$ game ⋮ SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY ⋮ IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM

This page was built for publication: Incidence Theorems and Their Applications