相关论文: A survey on the Weierstrass approximation theorem

We consider the problem of finding the infimum, over probability measures being in a ball defined by Wasserstein distance, of the expected value of a bounded Lipschitz random variable on $\mathbf{R}^d$. We show that if the $\sigma-$algebra…

We prove some results on when functions on compact sets $K \subset \mathbb C$ can be approximated by polynomials avoiding values in given sets. We also prove some higher dimensional analogues. In particular we prove that a continuous…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

Under the assumption of the existence of Stahl's $S$-compact set we give a short proof of the limit zeros distribution of Pad\'e polynomials and convergence in capacity of diagonal Pad\'e approximants for a generic class of algebraic…

Efroymson's approximation theorem asserts that if $f$ is a $\mathcal{C}^0$ semialgebraic mapping on a $\mathcal{C}^\infty$ semialgebraic submanifold $M$ of $\mathbb{R}^n$ and if $\varepsilon:M\to \mathbb{R}$ is a positive continuous…

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…

We describe the Fundamental Theorem on Symmetric Polynomials (FTSP), exposit a classical proof, and offer a novel proof that arose out of an informal course on group theory. The paper develops this proof in tandem with the pedagogical…

The pointwise estimates of the deviations $\widetilde{T}_{n,A,B}^{\text{}%}f\left(\cdot \right) -\widetilde{f}(\cdot)$ and $\widetilde{T}_{n,A,B}^{% \text{}}f\left(\cdot \right) -\widetilde{f}(\cdot,\varepsilon)$ in terms of moduli of…

The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…

This is a survey article on selected topics in approximation theory. The topics either use techniques from the theory of several complex variables or arise in the study of the subject. The survey is aimed at readers having an acquaintance…

Consider quasianalytic local rings of germs of smooth functions closed under composition, implicit equation, and monomial division. We show that if the Weierstrass Preparation Theorem holds in such a ring then all elements of it are germs…

In 1931, Banach proved that, far from being exceptional objects, the Weierstrass functions form a residual set in the space $\mathcal{C}[0,1]$ of continuous functions. Later on, in 1966, V. I. Gurariy showed that, except for zero, there is…

We establish a uniform approximation result for the Taylor polynomials of the xi function of Riemann which is valid in the entire complex plane as the degree grows. In particular, we identify a domain growing with the degree of the…

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…

Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…

We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…

We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…

We study H\"older continuity, $p^\mathrm{th}$-variation function and Riesz variation of Weierstrass-type functions along the sequence of $b$-adic partitions, where $b>1$ is an integer. By a Weierstrass-type function, we mean that in the…

In this paper we survey the theory of holomorphic approximation, from the classical 19th century results of Runge and Weierstrass, continuing with the 20th century work of Oka and Weil, Mergelyan, Vitushkin and others, to the most recent…

The Figiel-Lindenstrauss-Milman inequality is a fundamental inequality in the combinatorial theory of polytopes. It is classically obtained as a corollary of Milman's version of Dvoretzky's theorem. The goal of this paper is to provide a…