Related papers: On the Bernstein's constant in convex approximatio…

We consider 1-dimensional location estimation, where we estimate a parameter $\lambda$ from $n$ samples $\lambda + \eta_i$, with each $\eta_i$ drawn i.i.d. from a known distribution $f$. For fixed $f$ the maximum-likelihood estimate (MLE)…

Let $A^2(D)$ be the Bergman space over the open unit disk $D$ in the complex plane. Korenblum conjectured that there is an absolute constant $c \in (0,1)$ such that whenever $|f(z)|\le |g(z)|$ in the annulus $c<|z|<1$ then $||f(z)|| \le…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

We discuss optimal constants in a recent result of Rudelson and Vershynin on marginal densities. We show that if $f$ is a probability density on $\R^n$ of the form $f(x)=\prod_{i=1}^n f_i(x_i)$, where each $f_i$ is a density on $\R$, say…

We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients. It is stated in terms of moduli of smoothness. In particular, it yields a big $O$-characterization…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

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 work, we present a new algorithm for maximizing a non-monotone submodular function subject to a general constraint. Our algorithm finds an approximate fractional solution for maximizing the multilinear extension of the function over…

We study approximation of the embedding $\ell_p^m \rightarrow \ell_{\infty}^m$, $1 \leq p \leq 2$, based on randomized adaptive algorithms that use arbitrary linear functionals as information on a problem instance. We show upper bounds for…

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

In this paper, we study the Bernstein polynomial model for estimating the multivariate distribution functions and densities with bounded support. As a mixture model of multivariate beta distributions, the maximum (approximate) likelihood…