Related papers: Uniform Approximation by Polynomials with Integer …

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…

It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…

Recently, Charpentier showed that there exist holomorphic functions $f$ in the unit disk such that, for any proper compact subset $K$ of the unit circle, any continuous function $\phi$ on $K$ and any compact subset $L$ of the unit disk,…

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.

Final representation of all those measures $\mu$ for which algebraic polynomials are dense in $L_p(R, d\mu)$ is found. The weighted analogue of the Weierstrass polynomial approximation theorem and a new version of the M. Krein's theorem…

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…

We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Let $\mathbb D^n\subset\mathbb C^n$ be the open unit polydisk, $K\subset\mathbb D^n$ be an $n$-ary Cartesian product of planar sets, and $\hat U\subset \mathfrak M^n$ be an open neighbourhood of the closure $\bar K$ of $K$ in $\mathfrak…

We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

We find the constant $b_{\infty}$ ($b_{\infty} \approx 4.81058280$) such that if a complex polynomial or entire function $f(z) = \sum_{k=0}^ \omega a_k z^k, $ $\omega \in \{2, 3, 4, \ldots \} \cup \{\infty\},$ with nonzero coefficients…