Related papers: Weak-star convergence and a polynomial approximati…

An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate…

We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…

For any abelian group $A$, we prove an asymptotic formula for the number of $A$-extensions $K/\mathbb{Q}$ of bounded discriminant such that the associated norm one torus $R_{K/\mathbb{Q}}^1 \mathbb{G}_m$ satisfies weak approximation. We are…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

A seminal result of Nisan and Szegedy (STOC, 1992) shows that for any total Boolean function, the degree of the real polynomial that computes the function, and the minimal degree of a real polynomial that point-wise approximates the…

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…

The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…

In this paper, with the aid of the simplicial approximation property, the Hopf's construction and Dugundji's homotopy extension Theorem, we first show that if C is a nonempty compact convex subset of an F-space (E; || ||); then for every…

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Let $\frak E$ denote be the ring of Eisenstein integers. Let $z\in \mathbb C$ and $p_n,q_n \in \frak E$ be such that $\{p_n/q_n\}$ is the sequence of convergents corresponding to the continued fraction expansion of $z$ with respect to the…

In this note we study a quantitative version of Bernstein's approximation problem when the polynomials are dense in weighted spaces on the real line completing a result of S.~N.~Mergelyan (1960). We estimate in the logarithmic scale the…

A common statistical task lies in showing asymptotic normality of certain statistics. In many of these situations, classical textbook results on weak convergence theory suffice for the problem at hand. However, there are quite some…

We study feedforward neural networks with inputs from a topological space (TFNNs). We prove a universal approximation theorem for shallow TFNNs, which demonstrates their capacity to approximate any continuous function defined on this…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Denoting by $E_{n}^{(+2)}(f)$ the best uniform approximation of $f$ by convex polynomials of degree $\le n$, there is an open question if there exists the limit $\lim_{n\to \infty}n^{\lambda}E_{n}^{(+2)}(|x|^{\lambda})$ for $\lambda \ge 1$.

The numerical approximation of the solution to a stochastic partial differential equation with additive spatial white noise on a bounded domain is considered. The differential operator is assumed to be a fractional power of an integer order…

In this very short paper, we provide a strong motivation for the study of the following problem: given a real normed space $E$, a closed, convex, unbounded set $X\subseteq E$ and a function $f:X\to X$, find suitable conditions under which,…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…