Related papers: Boundary behavior of optimal polynomial approximan…

In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…

In this paper we consider the problem of counting algebraic numbers $\alpha$ of fixed degree $n$ and bounded height $Q$ such that the derivative of the minimal polynomial $P_{\alpha}(x)$ of $\alpha$ is bounded, $|P_{\alpha}'(\alpha)| <…

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.

In this paper we find extremal one-sided approximations of exponential type for a class of truncated and odd functions with a certain exponential subordination. These approximations optimize the $L^1(\mathbb{R}, |E(x)|^{-2}dx)$-error, where…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…

Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…

For $d \geq 2, \ D \geq 1$, let $\mathscr{P}_{d,D}$ denote the set of all degree $d$ polynomials in $D$ dimensions with real coefficients without linear terms. We prove that for any Calder\'{o}n-Zygmund kernel, $K$, the maximally modulated…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

We give tight bounds on the degree $\ell$ homogenous parts $f_\ell$ of a bounded function $f$ on the cube. We show that if $f: \{\pm 1\}^n \rightarrow [-1,1]$ has degree $d$, then $\| f_\ell \|_\infty$ is bounded by $d^\ell/\ell!$, and $\|…

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Let $T\colon X\to X$ be a bounded operator on Banach space, whose spectrum $\sigma(T)$ is included in the closed unit disc $\overline{\mathbb D}$. Assume that the peripheral spectrum $\sigma(T)\cap{\mathbb T}$ is finite and that $T$…

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…

We present two novel methods for approximating minimizers of the abstract Rayleigh quotient $\Phi(u)/ \|u\|^p$. Here $\Phi$ is a strictly convex functional on a Banach space with norm $\|\cdot\|$, and $\Phi$ is assumed to be positively…

The universal approximation theorem, in one of its most general versions, says that if we consider only continuous activation functions $\sigma$, then a standard feedforward neural network with one hidden layer is able to approximate any…

The problem of finding the correct asymptotic rate of approximation by polynomial loops in dependence of the smoothness of the elements of a loop group seems not well-understood in general. For matrix Lie groups such as SU(N), it can be…

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

A Littlewood polynomial is a polynomial of the form \[ f_n(x)=\sum_{k=0}^n \varepsilon_k x^k \] with $\varepsilon_k\in\{-1, 1\}$. Let $(\varepsilon_k)_{k \ge 0}$ be i.i.d. Rademacher coefficients. We show that the lower envelope of…

Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…

Consider the class of optimal partition problems with long range interactions \[ \inf \left\{ \sum_{i=1}^k \lambda_1(\omega_i):\ (\omega_1,\ldots, \omega_k) \in \mathcal{P}_r(\Omega) \right\}, \] where $\lambda_1(\cdot)$ denotes the first…