Related papers: V. Markov's problem for monotone polynomials
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…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
We introduce an asymptotic Markov's exponent and show that it is equal to Markov's exponent for a wide class of norms. As a consequence we obtain a lower bound for the optimal exponent in Markov's inequality considered with the norms…
We summarize researches - in great deal jointly with my host Y. Sarantopoulos and his PhD. students V. Anagnostopoulos and A. Pappas - started by a Marie Curie fellowship in 2001 and is still continuing. The project was to study…
We consider polynomials of degree $d$ with only real roots and a fixed value of discriminant, and study the problem of minimizing the absolute value of polynomials at a fixed point off the real line. There are two explicit families of…
Given a pure binomial ideal I in variables x_i, we define a new measure of the complexity of the saturation of I with respect to the product of the variables x_i, which we call the norm. We give a bound on the norm in terms of…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
The standard well-known Remez inequality gives an upper estimate of the values of polynomials on $[-1,1]$ if they are bounded by $1$ on a subset of $[-1,1]$ of fixed Lebesgue measure. The extremal solution is given by the rescaled Chebyshev…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
This paper continues our work [19] on sharp Alexandrov estimates. We obtain a sharp global uniform distance estimate from a convex function to the class of unimodular convex quadratic polynomials in terms of the total variation of its…
We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related…
We introduce a multivariate Markov transform which generalizes the well-known one-dimensional Stieltjes transform from the Moment problem and Spectral theory. Our main result states that two measures {\mu} and {\nu} with bounded support…
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…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…
The aim of this paper is to prove that Markov's theorem on variation of zeros of orthogonal polynomials on the real line [Math. Ann., 27:177-182,1886] remains essentially valid in the case of paraorthogonal polynomials on the unit circle.
A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…
The classical A. Markov inequality establishes a relation between the maximum modulus or the $L^{\infty}\left([-1,1]\right)$ norm of a polynomial $Q_{n}$ and of its derivative: $\|Q'_{n}\|\leqslant M_{n} n^{2}\|Q_{n}\|$, where the constant…