Related papers: On Cone Restriction Estimates in Higher Dimensions
We consider Guth's approach to the Fourier restriction problem via polynomial partitioning. By writing out his induction argument as a recursive algorithm and introducing new geometric information, known as the polynomial Wolff axioms, we…
We obtain improved Fourier restriction estimate for the truncated cone using the method of polynomial partitioning in dimension $n\geq 3$, which in particular solves the cone restriction conjecture for $n=5$, and recovers the sharp range…
This note records an asymptotic improvement on the known $L^p$ range for the Fourier restriction conjecture in high dimensions. This is obtained by combining Guth's polynomial partitioning method with recent geometric results regarding…
We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…
We adapt Guth's polynomial partitioning argument for the Fourier restriction problem to the context of the Kakeya problem. By writing out the induction argument as a recursive algorithm, additional multiscale geometric information is made…
The first purpose of this paper is to solve completely the finite field cone restriction conjecture in four dimensions with $-1$ non-square. The second is to introduce a new approach to study incidence problems via restriction theory. More…
We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…
The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…
A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…
In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…
We explore computational aspects of maximum likelihood estimation of the mixture proportions of a nonparametric finite mixture model -- a convex optimization problem with old roots in statistics and a key member of the modern data analysis…
This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…
We prove some weighted Fourier restriction estimates using polynomial partitioning and refined Strichartz estimates. As application we obtain improved spherical average decay rates of the Fourier transform of fractal measures, and therefore…
An important inequality due to Wolff on plate decompositions of cone multipliers is known to have consequences for a variety of problems in harmonic analysis. We observe that the range in Wolff's inequality, for the conic and the spherical…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
In this paper, we prove restriction estimates for hyperbolic paraboloids in dimensions $n>=5$ by the polynomial partitioning method.
The Frank-Wolfe (FW) method is a popular algorithm for solving large-scale convex optimization problems appearing in structured statistical learning. However, the traditional Frank-Wolfe method can only be applied when the feasible region…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…