Related papers: Zeros of Optimal Functions in the Cohn-Elkies Line…
Inspired by applications in weighted polynomial approximation problems, we study an optimal mass distribution problem. Given a gauge function $h$ and a positive "roof" function $R$ compactly supported in $\mathbb{R}^n$, we are interested in…
Katz and Sarnak conjectured a correspondence between the $n$-level density statistics of zeros from families of $L$-functions with eigenvalues from random matrix ensembles. In many cases the sums of smooth test functions, whose Fourier…
In this paper, we study the problem of computing by relaxation hierarchies the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, if they exist. We show that when the…
We study the problem of multivariate $L_2$-approximation of functions in a weighted Korobov space using a median lattice-based algorithm recently proposed by the authors. In the original work, the algorithm requires knowledge of the…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
We propose a simple and effective method for designing approximation formulas for weighted analytic functions. We consider spaces of such functions according to weight functions expressing the decay properties of the functions. Then, we…
The classical ``$H=W$" theorem establishes the identity between two function spaces on an arbitrary nonempty open set in the Euclidean spaces: the space $W$ defined via weak derivatives, and the space $H$ defined as the closure of smooth…
We study the zeros sets of functions in the Dirichlet space. Using Carleson formula for Dirichlet integral, we obtain some new families of zero sets. We also show that any closed subset of $E \subset \TT$ with logarithmic capacity zero is…
Bourgain in his seminal paper [2] about the analysis of maximal functions associated to convex bodies, has estimated in a sharp way the $L^2$-operator norm of the maximal function associated to a kernel $K\in L^1,$ with differentiable…
Suppose that $K\subset\C$ is compact and that $z_0\in\C\backslash K$ is an external point. An optimal prediction measure for regression by polynomials of degree at most $n,$ is one for which the variance of the prediction at $z_0$ is as…
In many real-world problems, first-order (FO) derivative evaluations are too expensive or even inaccessible. For solving these problems, zeroth-order (ZO) methods that only need function evaluations are often more efficient than FO methods…
Let $\mathcal{X}$ be a metric space with doubling measure and $L$ a non-negative self-adjoint operator on $L^2(\mathcal{X})$ whose heat kernels satisfy the Gaussian upper bound estimates. Assume that the growth function $\varphi:\…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
Dang et al. have given an algorithm that can find a Tarski fixed point in a $k$-dimensional lattice of width $n$ using $O(\log^{k} n)$ queries. Multiple authors have conjectured that this algorithm is optimal [Dang et al., Etessami et al.],…
We study an optimal stretching problem for certain convex domain in $\mathbb{R}^d$ ($d\geq 3$) whose boundary has points of vanishing Gaussian curvature. We prove that the optimal domain which contains the most positive (or least…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
We study entire functions whose zeros and one-points lie on distinct finite systems of rays. General restrictions on these rays are obtained. Non-trivial examples of entire functions with zeros and one-points on different rays are…
We consider an optimal stretching problem for strictly convex domains in $\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$.…
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…
In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…