Related papers: On the zero-free polynomial approximation problem

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

We prove an analogue of the classical Bernstein polynomial inequality on a compact subset $E$ of the real line. The Lipschitz continuity of the Green function for the complement of $E$ with respect to the extended complex plane and the…

The 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 error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM…

We show that every real polynomial $f$ nonnegative on $[-1,1]^{n}$ can be approximated in the $l_{1}$-norm of coefficients, by a sequence of polynomials $\{f_{\ep r}\}$ that are sums of squares. This complements the existence of s.o.s.…

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Testing whether a set $\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebraic independence testing question is wide open over finite…

Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…

In this article, we establish a Liouville-type inequality for polynomials evaluated at the values of arbitrary Siegel E-functions at non-zero algebraic points. Additionally, we provide a comparable result within the framework of Mahler M…

It follows from a theorem of Rosenthal that a compact space is $ccc$ if and only if every Eberlein continuous image is metrizable. Motivated by this result, for a class of compact spaces $\mathcal{C}$ we define its orthogonal…

In this article we propose a new class of the even entire function connected with the product and series with the real coefficients. We address a sufficient condition for all real zeros for it. As a typical example, we give an answer to the…

We characterize the uniform limits of Dirichlet polynomials on a right half plane. In the Dirichlet setting, we find approximation results, with respect to the Euclidean distance and {to} the chordal one as well, analogous to classical…

Let $\mathcal K$ be a complete quasivariety of completely regular universal topological algebras of continuous signature $\mathcal E$ (which means that $\mathcal K$ is closed under taking subalgebras, Cartesian products, and includes all…

Arakeljan's Theorem provides conditions on a relatively closed subset $F$ of a domain $G\subset\mathbb{C}$, such that any continuous function $f:F\rightarrow\mathbb{C}$ that is analytic in $F^\circ$, can be approximated by analytic…

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy.…