Related papers: Strong Converse Inequalities for Bernstein Polynom…
We obtain strong converse inequalities for the Bernstein operators with explicit constants. One of the main ingredients in our approach is the representation of the derivatives of the Bernstein operators in terms of the orthogonal…
An asymptotic expansion for inverse moments of positive binomial and Poisson distributions is derived. The expansion coefficients of the asymptotic series are given by the positive central moments of the distribution. Compared to previous…
The Markov-Bernstein type inequalities between the norms of functions and of their derivatives are analysed for complex exponential polynomials. We establish a relation between the sharp constants in those inequalities and the stability…
We derive the non-asymptotical non-uniform sharp error estimation for Bernstein's approximation of continuous function based on the modern probabilistic apparatus. We investigate also the convergence of derivative of these polynomials and…
We prove limit relations between the sharp constants in the multivariate Bernstein-Nikolskii type inequalities for trigonometric polynomials and entire functions of exponential type with the spectrum in a centrally symmetric convex body.
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…
It is demonstrated that multiplier methods naturally yield better constants in strong converse inequalities for the Bernstein-Durrmeyer operator. The absolute constants obtained in some of the inequalities are independent of the weight and…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
In this note, we consider asymptotic products of binomial and multinomial coefficients and determine their asymptotic constants and formulas. Among them, special cases are the central binomial coefficients, the related Catalan numbers, and…
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables including Gaussian, Boolean, exponential, Poisson and many…
We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.
In the first five sections, we deal with the class of probability measures with asymptotically periodic Verblunsky coefficients of p-type bounded variation. The goal is to investigate the perturbation of the Verblunsky coefficients when we…
Concentration inequalities, a major tool in probability theory, quantify how much a random variable deviates from a certain quantity. This paper proposes a systematic convex optimization approach to studying and generating concentration…
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…
We consider the Bernoulli polynomials of the second kind, which can be related to the generalised Bernoulli polynomials $B_n^{(n)}(z)$. The asymptotic expansions of the scaled polynomials $B_n^{(n)}(nz)$ are obtained as $n\to\infty$ when…
We establish Bernstein's inequalities for functions of general (general-state-space and possibly non-reversible) Markov chains. These inequalities achieve sharp variance proxies and encompass the classical Bernstein inequality for…
We study the exact constants in the moment inequalities for sums of centered independent random variables: improve their asymptotics, low and upper bounds, calculate more exact asymptotics, elaborate the numerical algorithm for their…
Compound Poisson distributions and signed compound Poisson measures are used for approximation of the Markov binomial distribution. The upper and lower bound estimates are obtained for the total variation, local and Wasserstein norms. In a…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…