combinatorial geometrydistinct distances problemfinite field Kakeya problemincidence geometryjoints problempolynomial method
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of finite geometries (05B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to real functions (26-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Linear codes and caps in Galois spaces (51E22) Erd?s problems and related topics of discrete geometry (52C10)
- scientific article; zbMATH DE number 6603592
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- scientific article; zbMATH DE number 2145241
- The finite field distance problem
- A point-conic incidence bound and applications over \(\mathbb{F}_p\)
- Maximal subspace averages
- \(L^2\) bounds for a maximal directional Hilbert transform
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Few cuts meet many point sets
- The Erdős distance problem
- scientific article; zbMATH DE number 6603592 (Why is no real title available?)
- scientific article; zbMATH DE number 2002746 (Why is no real title available?)
- New applications of the polynomial method: the cap set conjecture and beyond
- scientific article; zbMATH DE number 1439417 (Why is no real title available?)
- The Multivariate Schwartz--Zippel Lemma
- Algebraic techniques in geometry. The 10th anniversary
- Improved bounds for the expected number of k-sets
- Geometric covering number: covering points with curves
- Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
- Combinatorial bounds in distal structures
- Partitioning theorems for sets of semi-Pfaffian sets, with applications
- Sticky Kakeya sets and the sticky Kakeya conjecture
- Semi-algebraic off-line range searching and biclique partitions in the plane
- A point-variety incidence theorem over finite fields, and its applications
- Point-polynomial incidences theorem with an application to Reed-Solomon codes
- Additive energies on spheres
- Structural Szemerédi-Trotter for lattices and their generalizations
- Intersection searching amid tetrahedra in four dimensions
- Unit and distinct distances in typical norms
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Incidences between curves and points on the grid
This page was built for publication: Polynomial methods and incidence theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862006)
