Related papers: Comonotone approximation and interpolation by enti…

Motivated by a problem on comonotone approximation of $C^n$ functions by entire functions, for increasing functions $f\colon[0,1]\to[0,1]$, we characterize the possible values of $(a,b,c)$, where $a=I(f)(1)$, $b=I^2(f)(1)$, $c=I^3(f)(1)$…

Let a $2\pi$-periodic function $f\in\Bbb C$ changes its monotonicity at a finitely even number of points $y_i$ of the period. The degree of approximation of this $f$ by trigonometric polynomials which are comonotone with it, i.e. that…

Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…

We present an approximation theorem for continuous non-decreasing functions on compact preordered spaces, leading to an algebraic characterization of their corresponding function spaces. As an application, we prove that the family of…

In this work we prove that if an entire function $f(z)$ is of order strictly less than one and it has only negative zeros, then for each nonnegative integer $k,m$ the real function…

Let $\mathscr{C}_\mathbb{Z}([0,1])$ be the metric space of real-valued continuous functions on $[0,1]$ with integer values at $0$ and $1$, equipped with the uniform (supremum) metric $d_\infty$. It is a classical theorem in approximation…

Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…

This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.

The present paper is a sequel to [Monatsh.~Math.\ {\bf 194} (2021), 523--554] in which results of that paper are generalized so that they hold in the setting of inhomogeneous Diophantine approximation. Given any integers $n \geq 2$ and…

The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose $K$ is a compact set in the complex plane and 0 belongs to the boundary $\partial K$. Let ${\cal A}(K)$ denote the space of all functions $f$ on $K$…

We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the…

It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…

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 $P_{2k}$ be a homogeneous polynomial of degree $2k$ and assume that there exist $C>0$, $D>0$ and $\alpha \ge 0$ such that \begin{equation*} \left\langle P_{2k}f_{m},f_{m}\right\rangle_{L^2(\mathbb{S}^{d-1})}\geq \frac{1}{C\left(…

Let $F$ be an entire function represented by absolutely convergent for all $z\in\mathbb{C}$ Dirichlet series of the form $ F(z) = \sum\nolimits_{n=0}^{+\infty} a_{n}e^{z\lambda_{n}},$\ where a sequence $(\lambda_n)$ such that…

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…