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[...
Main Author: | Guth, Lawrence |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Springer US
2016
|
Online Access: | http://hdl.handle.net/1721.1/105456 https://orcid.org/0000-0002-1302-8657 |
Similar Items
Similar Items
-
A restriction estimate using polynomial partitioning
by: Guth, Lawrence
Published: (2018) -
Restriction estimates using polynomial partitioning II
by: Guth, Larry
Published: (2021) -
On the Erdős distinct distances problem in the plane
by: Guth, Lawrence, et al.
Published: (2015) -
Sharp estimates for oscillatory integral operators via polynomial partitioning
by: Guth, Larry, et al.
Published: (2021) -
Polynomial partitioning for a set of varieties
by: GUTH, LARRY
Published: (2017)