Distinct Distance Estimates and Low Degree Polynomial Partitioning
We give a shorter proof of a slightly weaker version of a theorem from Guth and Katz (Ann Math 181:155-190, 2015): we prove that if L is a set of L lines in R[superscript 3] with at most L[superscript 1/2] lines in any low degree algebraic surface, then the number of r-rich points of is L is ≲ L[sup...
Main Author: | Guth, Lawrence (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer US,
2016-11-29T15:31:23Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
A restriction estimate using polynomial partitioning
by: Guth, Lawrence
Published: (2018) -
Polynomial partitioning for a set of varieties
by: GUTH, LARRY
Published: (2017) -
On the Erdős distinct distances problem in the plane
by: Guth, Lawrence, et al.
Published: (2015) -
Polynomial Wolff axioms and Kakeya-type estimates in R4
by: Guth, Lawrence, et al.
Published: (2018) -
Unexpected Applications of Polynomials in Combinatorics
by: Guth, Lawrence
Published: (2018)