Related papers: Restriction estimates using polynomial partitionin…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…
We investigate numerical differentiation formulas on irregular centers in two or more variables that are exact for polynomials of a given order and minimize an absolute seminorm of the weight vector. Error bounds are given in terms of a…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…
If $S$ is a smooth compact surface in $\mathbb{R}^3$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3.25$, $\| E_S f\|_{L^p(\mathbb{R}^3)} \le C(p,S) \| f…
In this paper, we study the problem of online sparse linear regression (OSLR) where the algorithms are restricted to accessing only $k$ out of $d$ attributes per instance for prediction, which was proved to be NP-hard. Previous work gave…
While several classes of integer linear optimization problems are known to be solvable in polynomial time, far fewer tractability results exist for integer nonlinear optimization. In this work, we narrow this gap by identifying a broad…
For continuous boundary data, including data of polynomial growth, modified Poisson integrals are used to write solutions to the half space Dirichlet and Neumann problems in $\mathbb{R}^{n}$. Pointwise growth estimates for these integrals…
In this short note, we address the discretization of optimal control problems with higher order polynomials. We develop a necessary and sufficient condition to ensure that weak limits of discrete feasible controls are feasible for the…
We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…
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…
In this article, we construct semiparametrically efficient estimators of linear functionals of a probability measure in the presence of side information using an easy empirical likelihood approach. We use estimated constraint functions and…
The line spectral estimation problem consists in recovering the frequencies of a complex valued time signal that is assumed to be sparse in the spectral domain from its discrete observations. Unlike the gridding required by the classical…
In this paper, we study the restriction estimate for a certain surface of finite type in $\mathbb{R}^3$, and partially improves the results of Buschenhenke-M\"{u}ller-Vargas. The key ingredients of the proof include the so called…
Our focus is on robust recovery algorithms in statistical linear inverse problem. We consider two recovery routines - the much studied linear estimate originating from Kuks and Olman [42] and polyhedral estimate introduced in [37]. It was…
Leveraging recent advances in additive combinatorics, we exhibit explicit matrices satisfying the Restricted Isometry Property with better parameters. Namely, for $\varepsilon=3.26\cdot 10^{-7}$, large $k$ and $k^{2-\varepsilon} \le N\le…
The aim of this paper is to prove a uniform Fourier restriction estimate for certain $2-$dimensional surfaces in $\mathbb R^{2n}$. These surfaces are the image of complex polynomial curves $\gamma(z) = (p_1(z), \dots, p_n(z))$, equipped…
The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed…
We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…