Related papers: Approximation of sets defined by polynomials with …

Representation of analytic functions as convergent series in Jacobi polynomials $P_n^{(a,b)}$ is reformulated using a unified approach for almost all complex $a, b$. The coefficients of the series are given as usual integrals in the…

Let $X$ and $Y$ be Banach spaces, let $\mathcal{A}(X)$ stands for the algebra of approximable operators on $X$, and let $P\colon\mathcal{A}(X)\to Y$ be an orthogonally additive, continuous $n$-homogeneous polynomial. If $X^*$ has the…

We study the computation of local approximations of invariant manifolds of parabolic fixed points and parabolic periodic orbits of periodic vector fields. If the dimension of these manifolds is two or greater, in general, it is not possible…

Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…

For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.

The polynomials that arise as coefficients when a power series is raised to the power $x$ include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such…

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

In this article, we introduce the concept of normal families of bicomplex holomorphic functions to obtain a bicomplex Montel theorem. Moreover, we give a general definition of Fatou and Julia sets for bicomplex polynomials and we obtain a…

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 characterize the uniform convergence points set of a pointwisely convergent sequence of real-valued functions defined on a perfectly normal space. We prove that if $X$ is a perfectly normal space which can be covered by a disjoint…

Let $D, G\subset{\Bbb C}$ be domains, let $A\subset D$, $B\subset G$ be locally regular sets, and let $X:=(D\times B)\cup(A\times G)$. Assume that $A$ is a Borel set. Let $M$ be a proper analytic subset of an open neighborhood of $X$. Then…

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

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…

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…