Concentration estimates for algebraic intersections
From MaRDI portal
Publication:6101972
Abstract: We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the method of degree-reduction that enables it to deal efficiently with higher-dimensional problems and also with high-degree varieties. We obtain sharp bounds that are new even in the case of lines in and show that besides doubly-ruled varieties, only a certain rare family of varieties can be relevant for the study of incidence questions.
Recommendations
Cites work
- scientific article; zbMATH DE number 6603592 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 2038305 (Why is no real title available?)
- scientific article; zbMATH DE number 1363210 (Why is no real title available?)
- scientific article; zbMATH DE number 3223507 (Why is no real title available?)
- scientific article; zbMATH DE number 3053541 (Why is no real title available?)
- A Szemerédi-Trotter type theorem in R^4
- A semi-algebraic version of Zarankiewicz's problem
- AN INCIDENCE CONJECTURE OF BOURGAIN OVER FIELDS OF POSITIVE CHARACTERISTIC
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Algebraic curves, rich points, and doubly-ruled surfaces
- Algebraic methods in discrete analogs of the Kakeya problem
- An improved bound on the number of point-surface incidences in three dimensions
- An incidence theorem in higher dimensions
- Bisector energy and few distinct distances
- Characteristic subsets and the polynomial method
- Combinatorial complexity bounds for arrangements of curves and spheres
- Curves in \(\mathbb {R}^4\) and two-rich points
- Distinct distance estimates and low degree polynomial partitioning
- Extremal problems in discrete geometry
- How to find groups?
- Incidences between points and lines in \({\mathbb {R}}^4\)
- Incidences with curves in \(\mathbb{R}^d\)
- On a problem of K. Zarankiewicz
- On a real analog of Bézout inequality and the number of connected components of sign conditions
- On counting point-hyperplane incidences
- On lines and joints
- On the Betti Numbers of Real Varieties
- On the Erdős distinct distances problem in the plane
- On the Number of Incidences Between Points and Curves
- On the number of rich lines in high dimensional real vector spaces
- On the number of rich lines in truly high dimensional sets
- On the size of Kakeya sets in finite fields
- Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
- Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem
- Refined bounds on the number of connected components of sign conditions on a variety
- Ruled surface theory and incidence geometry
- Szemerédi-Trotter-type theorems in dimension 3
- The flecnode polynomial: a central object in incidence geometry
- The joints problem in \(\mathbb{R}^n\)
- The polynomial method over varieties
- Unit distances in three dimensions
This page was built for publication: Concentration estimates for algebraic intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101972)