scholarly journals Weighted restriction estimates using polynomial partitioning

2017 ◽  
Vol 115 (3) ◽  
pp. 545-598 ◽  
Author(s):  
Bassam Shayya
2019 ◽  
Vol 61 (4) ◽  
pp. 756-777
Author(s):  
Kunal Dutta ◽  
Arijit Ghosh ◽  
Bruno Jartoux ◽  
Nabil H. Mustafa

2012 ◽  
Vol 21 (4) ◽  
pp. 597-610 ◽  
Author(s):  
HAIM KAPLAN ◽  
JIŘÍ MATOUŠEK ◽  
ZUZANA SAFERNOVÁ ◽  
MICHA SHARIR

We show that the number of unit distances determined bynpoints in ℝ3isO(n3/2), slightly improving the bound of Clarkson, Edelsbrunner, Guibas, Sharir and Welzl [5], established in 1990. The new proof uses the recently introduced polynomial partitioning technique of Guth and Katz [12]. While this paper was still in a draft stage, a similar proof of our main result was posted to the arXiv by Joshua Zahl [28].


2015 ◽  
Vol 159 (3) ◽  
pp. 459-469 ◽  
Author(s):  
LARRY GUTH

AbstractGiven a set Γ of low-degree k-dimensional varieties in$\mathbb{R}$n, we prove that for anyD⩾ 1, there is a non-zero polynomialPof degree at mostDso that each component of$\mathbb{R}$n\Z(P) intersectsO(Dk−n|Γ|) varieties of Γ.


2016 ◽  
Vol 19 (3) ◽  
pp. 1653-1660
Author(s):  
Pavle V. M. Blagojević ◽  
Aleksandra S. Dimitrijević Blagojević ◽  
Günter M. Ziegler

2020 ◽  
Vol 49 (6) ◽  
pp. 1109-1127
Author(s):  
Boris Aronov ◽  
Esther Ezra ◽  
Joshua Zahl

Sign in / Sign up

Export Citation Format

Share Document