Related papers: V. Markov's problem for monotone polynomials

We prove that the sharp constant in the univariate Bernstein--Nikolskii inequality for entire functions of exponential type is the limit of the sharp constant in the V. A. Markov type inequality with an exponential weight for coefficients…

Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The…

The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

We consider randomized Verblunsky parameters for orthogonal polynomials on the unit circle as they relate to the problem of Steklov, bounding the polynomials' uniform norm independent of $n$.

Markov polynomials are the Laurent-polynomial solutions of the generalised Markov equation $$X^2 + Y^2 + Z^2 = kXYZ, \quad k=\frac{x^2 + y^2 + z^2}{x y z}$$ which are the results of cluster mutations applied to the initial triple $(x, y,…

A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

Stochastically monotone Markov chains arise in many applied domains, especially in the setting of queues and storage systems. Poisson's equation is a key tool for analyzing additive functionals of such models, such as cumulative sums of…

We consider an extremal problem for polynomials, which is dual to the well-known Smale mean value problem. We give a rough estimate depending only on the degree.

Let W: R to (0,1] be continuous. Bernstein's approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm ||fW|| Linfinity(R) . The qualitative form of this problem was solved by Achieser,…

According to the Kouchnirenko formula, the Milnor number of a generic isolated singularity with given Newton polyhedron is equal to the alternating sum of certain volumes associated to the Newton polyhedron. In this paper we obtain a…

We give a simple and entirely elementary proof of Gasper's theorem on the Markov sequence problem for Jacobi polynomials. It is based on the spectral analysis of an operator that arises in the study of a probabilistic model of colliding…

In the field of orthogonal polynomials theory, the classical Markov theorem shows that for determinate moment problems the spectral measure is under control of the polynomials asymptotics. The situation is completely different for…

Extremal problems for typically real polynomials go back to a paper by W. W. Rogosinski and G. Szeg\H{o}, where a number of problems were posed, which were partially solved by using orthogonal polynomials. Since then, not too many new…

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 establish a new Bernstein-type deviation inequality for general (non-reversible) discrete-time Markov chains via an elementary approach. More robust than existing works in the literature, our result only requires the Markov chain to…

The conjecture by Steklov was solved negatively by Rakhmanov in 1979. His original proof was based on the formula for orthogonal polynomial obtained by adding point masses to the measure of orthogonality. In this note, we show how this…

We obtain the sharp lower bound for the uniform norm of the orthogonal polynomials in the Steklov class. We also prove the sharp estimates for the polynomial entropy in this class.

Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is…