Related papers: V. Markov's problem for monotone polynomials
We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However,…
This article shows how coupled Markov chains that meet exactly after a random number of iterations can be used to generate unbiased estimators of the solutions of the Poisson equation. Through this connection, we re-derive known unbiased…
The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…
We prove that the previously established inequality of different metrics for algebraic polynomials is sharp in the sense of order.
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
We consider the mirror-prox algorithm for solving monotone Variational Inequality (VI) problems. As the mirror-prox algorithm is not practically implementable, except in special instances of VIs (such as affine VIs), we consider its…
We consider the problem of defining and computing real analogs of polynomial Hurwitz numbers, in other words, the problem of counting properly normalized real polynomials with fixed ramification profiles over real branch points. We show…
The purpose of this paper is to study a Markov type inequality for algebraic polynomials in $L^p$ norm on two-dimensional cuspidal domains.
We consider Liouville-type and partial regularity results for the nonlinear fourth-order problem $$ \Delta^2 u=|u|^{p-1}u\ \{in} \ \R^n,$$ where $ p>1$ and $n\ge1$. We give a complete classification of stable and finite Morse index…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
In this paper we prove that the gradient ideal of a Morse polynomial is radical. This gives a generic class of polynomials whose gradient ideals are radical. As a consequence we reclaim a previous result that the unconstrained polynomial…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
The purpose of this note is to establish, from the hypergeometric-type difference equation introduced by Nikiforov and Uvarov, new tractable sufficient conditions for the monotonicity with respect to a real parameter of zeros of classical…
The purpose of this note is to establish, in terms of the primary coefficients in the framework of the tridiagonal theory developed by Delsarte and Genin in the environment of nonnegative definite Toeplitz matrices, necessary and sufficient…
For a pair of conjugate trigonometrical polynomials $C (t) = \sum_ { j = 1 } ^N { { a_j}\cos jt }, S(t) = \sum_ { j = 1 } ^N { { a_j}\sin jt }$ with real coefficients and normalization ${a_1} = 1 $ we solve the extremal problem \[ \sup_…
In this note we show that sharp Kolmogorov-type inequalities that estimate the uniform norm $\|f^{(k)}\|$ of the $k$-th derivative of a function $f\colon \mathbb{R}\to\mathbb{R}$ by the values of the uniform norm of $f$ and uniform norms of…
In the class of normalized sine-polynomials $S(t),$ non-negative on $[0,\pi],$ W.Rogosinski and G.Szeg\H{o} 1950 considered a number of extremal problems and proved, among other things, sharp upper and lower estimates for the coefficient…