Related papers: Comonotone approximation and interpolation by enti…
We prove the existence of holomorphic functions $f$ defined on any open convex subset ${\rm \Omega}\subset {{\mathbb C}}^n$, whose partial sums of the Taylor developments approximate uniformly any complex polynomial on any convex compact…
Completely multiplicative functions whose sum is zero ($CMO$).The paper deals with $CMO$, meaning completely multiplicative ($CM$) functions $f$ such that $f(1)=1$ and $\sum\limits\_1^\infty f(n)=0$. $CM$ means $f(ab)=f(a)f(b)$ for all…
Under the assumption that the approximating function $\psi$ is monotonic, the classical Khintchine-Groshev theorem provides an elegant probabilistic criterion for the Lebesgue measure of the set of $\psi$-approximable matrices in $\R^{mn}$.…
We provide a characterization of those nonmonotonic inference operations C for which C(X) may be described as the set of all logical consequences of X together with some set of additional assumptions S(X) that depends anti-monotonically on…
Let $\{a_n\}_{n\in\mathbb{N}}$, $\{b_n\}_{n\in \mathbb{N}}$ be two infinite subsets of positive integers and $\psi:\mathbb{N}\to \mathbb{R}_{>0}$ be a positive function. We completely determine the Hausdorff dimensions of the set of all…
A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…
Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…
It is known from the Runge approximation theorem that every function which is holomorphic in a neighborhood of a compact polynomially convex set $K\subset \complexes^{n}$ can be approximated uniformly on $K$ by analytic polynomials. We…
Let $f$ be a holomorphic function on the unit disc, and $(S_{n_{k}})$ be a subsequence of its Taylor polynomials about $0$. It is shown that the nontangential limit of $f$ and lim$_{k\rightarrow \infty }S_{n_{k}}$ agree at almost all points…
Let $ f:(0,\infty)\rightarrow \Bbb{R} $ be a completely monotonic function. In this paper, we present some properties of this functions and several new classes of completely monotonic functions. We also give some special functions such that…
We prove that every completely monotone function defined on a right-unbounded open interval admits a Newton series expansion at every point of that interval. This result can be viewed as an analog of Bernstein's little theorem for…
Let $U\subseteq\mathbb{R}^d$ be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. We also show…
Let $D$ be the open unit disc in the complex plane. We denote by $\mathbb{C}$ the set of complex numbers and consider any compact set $K$ which is disjoint from $D$ and which also has connected complement. Let $A(K)$ denote all the…
We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…
In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…
We introduce the notion of Dunkl completely monotonic functions on $\left(-\sigma,\sigma\right), \sigma>0$. We establish a restrictive version of the analogue of Schoenberg's theorem in Dunkl setting.
The function f:X -> Y is called k-monotonically increasing if there is a partition X = X_1 U ... U X_k such that f|X_i : X_i -> Y is monotonically increasing for i=1,...,k. It is proved that a one-to-one function f:N -> N is k-monotonically…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
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 develop a Glivenko--Cantelli theory for monotone, almost additive functions of i.\,i.\,d.\ sequences of random variables indexed by~$\Z^d$. Under certain conditions on the random sequence, short range correlations are allowed as well. We…