Related papers: Polynomial approximation avoiding values in counta…

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

We study the Lusin approximation problem for real-valued measurable functions on Carnot groups. We prove that k-approximate differentiability almost everywhere is equivalent to admitting a Lusin approximation by $C^{k}_{\mathbb{G}}$ maps.…

A compact subset $K$ of the complex plane $\C$ is a set of polynomial (respectively rational) approximation if $P(K)=A(K)$ (respectively $R(K)=A(K)$), where $P(K)$ (respectively $R(K)$) is the family of functions on $K$ which are uniform…

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…

Let $R$ be an affine domain of characteristic zero with finite quotients. We prove that a polynomial map over $R$ is surjective if and only if it is surjective over $\hat{R_{\mathfrak{m}}}$, the completion of $R$ with respect to…

The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose $K$ is a compact set in the complex plane and 0 belongs to the boundary $\partial K$. Let ${\cal A}(K)$ denote the space of all functions $f$ on $K$…

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…

We show that on separable Banach spaces admitting a separating polynomial, any uniformly continuous, bounded, real-valued function can be uniformly approximated by Lipschitz, analytic maps on bounded sets.

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

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.…

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…