Related papers: A sharpening of a problem on Bernstein polynomials…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
In this article, we obtain two interesting general inequalities concerning Riemman sums of convex functions, which in particular, sharpen Alzer's inequality and give a suitable converse for it.
We define the notion of Bernstein measures and Bernstein approximations over general convex polytopes. This generalizes well-known Bernstein polynomials which are used to prove the Weierstrass approximation theorem on one dimensional…
In this paper we prove two conjectures stated by Chao-Ping Chen in [Int. Trans. Spec. Funct. 23:12 (2012), 865--873], using a method for proving inequalities of mixed trigonometric polynomial functions.
Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…
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…
We derive new integral estimates of the derivatives of mean $n$-valent functions in the unit disk. Our results develop and complement estimates obtained by E.P. Dolzhenko and A.A. Pekarskii, as well as recent inequalities obtained by the…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
In the geometry of polynomials, Schoenberg's conjecture, now a theorem, is a quadratic inequality between the zeros and critical points of a polynomial whose zeros have their centroid at the origin. We call its generalizations to other…
Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…
We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.
The Sz\'asz inequality is a classical result that provides a bound for polynomials with zeros in the upper half of the complex plane, expressed in terms of their low-order coefficients. Generalizations of this result to polynomials in…
I. M. Milin proposed, in his 1971 paper, a system of inequalities for the logarithmic coefficients of normalized univalent functions on the unit disk of the complex plane. This is known as the Lebedev-Milin conjecture and implies the…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
We establish sharp inequalities involving the incomplete Beta and Gamma functions. These inequalities arise in the approximation of generalized Bernstein functions by higher order Thorin-Bernstein functions. Furthermore, new properties of a…
We answer Totik's question on weighted Bernstein's inequalities showing that $$ \|T_n'\|_{L_p(\omega)} \le C(p,\omega)\, {n}\,\|T_n\|_{L_p(\omega)},\qquad 0<p\le \infty, $$ holds for all trigonometric polynomials $T_n$ and certain…
In 2009, Maksa and P\'ales established an extension of the decomposition theorem of Ng in the context of higher-order convexity notions. They proved that a real function is Wright convex of order $n$ if and only if it can be decomposed as…
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…
We give, using higher Bernstein polynomials defined in our paper [2], a stronger version of our previous result in [1] whose converse is proved in [2] and we give some complements to the results in [2] which help to compute these higher…
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…