Related papers: On best constants in $L^2$ approximation

Consider the Poincar\'e-Sobolev inequality on the hyperbolic space: for every $n \geq 3$ and $1 < p \leq \frac{n+2}{n-2},$ there exists a best constant $S_{n,p, \lambda}(\mathbb{B}^{n})>0$ such that $$S_{n, p,…

We study the $L^2$ spectral gap of a large system of strongly coupled diffusions on unbounded state space and subject to a double-well potential. This system can be seen as a spatially discrete approximation of the stochastic Allen-Cahn…

We determine the submaximal dimensions of the spaces of almost Einstein scales and normal conformal Killing fields for connected conformal manifolds. The results depend on the signature and dimension $n$ of the conformally nonflat conformal…

In this paper, we address a question of Donaldson's on the best estimate that can be achieved for the transversality of an asymptotically holomorphic sequence of sections of increasing powers of a line bundle over an integral symplectic…

We give an easy optimal bound for the dimension of the subspaces generated by the best Diophantine approximations.

We derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…

We investigate asymptotically sharp upper and lower bounds for the approximation numbers of the compact Sobolev embeddings $\overset{\circ}{W}{^m}(\Omega)\hookrightarrow L_2(\Omega)$ and $ W^m(\Omega)\hookrightarrow L_2(\Omega)$, defined on…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

In this paper we investigate known Singleton-like bounds in the Lee metric and characterize optimal codes, which turn out to be very few. We then focus on Plotkin-like bounds in the Lee metric and present a new bound that extends and…

The coordinate-wise median is a classic and most well-studied strategy-proof mechanism in social choice and facility location scenarios. Surprisingly, there is no systematic study of its approximation ratio in $d$-dimensional spaces. The…

We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…

We study the asymptotic expansion for the Landau constants $G_n$ $$\pi G_n\sim \ln N + \gamma+4\ln 2 + \sum_{s=1}^\infty \frac {\beta_{2s}}{N^{2s}},~~n\rightarrow \infty, $$ where $N=n+3/4$, $\gamma=0.5772\cdots$ is Euler's constant, and…

We provide sharp lower and upper bounds for the Gelfand widths of $\ell_p$-balls in the $N$-dimensional $\ell_q^N$-space for $0<p\leq 1$ and $p<q \leq 2$. Such estimates are highly relevant to the novel theory of compressive sensing, and…

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

Linear Least Squares is a very well known technique for parameter estimation, which is used even when sub-optimal, because of its very low computational requirements and the fact that exact knowledge of the noise statistics is not required.…

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let $B_n$ be the number of nonisomorphic…

One of the hard optimization problems that has a semi-definite relaxation with quantitative bound on the approximation error is the maximization of a convex quadratic form on the hypercube. The relaxation not only yields an upper bound on…

We consider the stability of Robust Optimization problems with respect to perturbations in their uncertainty sets. We focus on Linear Optimization problems, including those with a possibly infinite number of constraints, also known as…