Related papers: Bernstein approximation and beyond: proofs by mean…
We study generalizations of the classical Bernstein operators on polynomial spaces, where instead of fixing $\mathbf{1}$ and $x$, we require that $\mathbf{1}$ and a strictly increasing polynomial $f_1$ be fixed. Via several examples, we…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
This paper goes back to a famous problem of Mahler in metrical Diophantine approximation. The problem has been settled by Sprindzuk and subsequently improved by Alan Baker and Vasili Bernik. In particular, Bernik's result establishes a…
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…
We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…
The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…
For the iterations of $x\mapsto |x-\theta|$ random functions with Lipschitz number one, we represent the dynamics as a Markov chain and prove its convergence under mild conditions. We also demonstrate that the Wasserstein metric of any two…
We provide comparison principles for convex functions through its proximal mappings. Consequently, we prove that the norm of the proximal operator determines a convex the function up to a constant. A new characterization of Lipschitzianity…
For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…
We prove a Berry-Esseen type inequality for approximating expectations of sufficiently smooth functions $f$, like $f=|\cdot|^3$, with respect to standardized convolutions of laws $P_1,\ldots, P_n$ on the real line by corresponding…
This note establishes a theoretical framework for finding (potentially overparameterized) approximations of a function on a compact set with a-priori bounds for the generalization error. The approximation method considered is to choose,…
In this article, we study the Lipschitz Geometry at infinity of complex analytic sets and we obtain results on algebraicity of analytic sets and on Bernstein's problem. Moser's Bernstein Theorem says that a minimal hypersurface which is a…
We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve…
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the…
In this paper, First we have given the modified form of (p,q)-analogues of Bernstein and Bernstein operators [21-23] and then we introduce a new analogue of Bernstein-Kantorovich operators which we call as (p,q)-Bernstein-Kantorovich…
Nikol'skii known theorem for the kernels satisfying a condition $A^*_n$, is proved and for kernels from wider class. Explicit formulas for calculating the value of an approximation of classes $\W^{r, \beta}_{p, n} $ by convolution operators…
In this paper, we give direct theorems on point wise and global approximation by new variants of Bernstein-Durrmeyer operator, introduced by A.-M. et al.[1].
We prove approximation results about sequences of Berezin transforms of finite sums of finite product of Toeplitz operators (and bounded linear maps, in general) in the spirit of Ramadanov and Skwarczynski theorems that are about…
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…
This paper presents very simple and easy integration-free proofs in the context of Weierstrass's theory of functions, of the Maximum and Minimum Modulus Principles and Gutzmer-Parseval Inequalities for polynomials and for functions…