Related papers: De Branges' theorem on approximation problems of B…
In this work, we look into some results about dense subspaces of $C[0,1]$. Being our starting point the Weierstrass' Approximation Theorem, we study generalization of this in two directions: the first one studying subspaces which also have…
Given a group $G$ and a number field $K$, the Grunwald problem asks whether given field extensions of completions of $K$ at finitely many places can be approximated by a single field extension of $K$ with Galois group G. This can be viewed…
We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients. It is stated in terms of moduli of smoothness. In particular, it yields a big $O$-characterization…
Classical (or ``global'') Bernstein theory establishes sharp control on entire functions of exponential type that are bounded and real-valued on the real axis. We localize some of this theory to rectangular regions $\{ x+iy: x \in I, 0 \leq…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
Polynomial approximation is studied in the Sobolev space $W_p^r(w_{\alpha,\beta})$ that consists of functions whose $r$-th derivatives are in weighted $L^p$ space with the Jacobi weight function $w_{\alpha,\beta}$. This requires…
We investigate the approximation capabilities of dense neural networks. While universal approximation theorems establish that sufficiently large architectures can approximate arbitrary continuous functions if there are no restrictions on…
The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…
We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…
The celebrated universal approximation theorems for neural networks roughly state that any reasonable function can be arbitrarily well-approximated by a network whose parameters are appropriately chosen real numbers. This paper examines the…
We study the growth of subhorizon perturbations in brane-induced gravity using perturbation theory. We solve for the linear evolution of perturbations taking advantage of the symmetry under gauge transformations along the extra-dimension to…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…
In this paper we study dual bases functions in subspaces. These are bases which are dual to functionals on larger linear space. Our goal is construct and derive properties of certain bases obtained from the construction, with primary focus…
We describe differentiation-invariant subspaces of $C^\infty(a,b)$ which admit spectral synthesis. This gives a complete answer to a question posed by A.~Aleman and B.~Korenblum. It turns out that this problem is related to a classical…
We study the approximation of univariate and multivariate set-valued functions (SVFs) by the adaptation to SVFs of positive samples-based approximation operators for real-valued functions. To this end, we introduce a new weighted average of…
We discuss Meyers-Serrin's type results for smooth approximations of functions $b=b(t,x):\mathbb{R}\times\mathbb{R}^n\to\mathbb{R}^m$, with convergence of an energy of the form \[ \int_{\mathbb{R}}\int_{\mathbb{R}^n} w(t,x)…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
For $G$ an open set in $\mathbb{C}$ and $W$ a non-vanishing holomorphic function in $G$, in the late 1990's, Pritsker and Varga characterized pairs $(G,W)$ having the property that any $f$ holomorphic in $G$ can be locally uniformly…
The classical theorem of Bishop-Phelps asserts that, for a Banach space X, the norm-achieving functionals in X* are dense in X*. Bela Bollobas's extension of the theorem gives a quantitative description of just how dense the norm-achieving…