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

We prove invariance theorems for general inequalities of different metrics and apply them to limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities with the polyharmonic operator for…

We give the sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum_{k=0}^{n}a_kz^k$, $a_n\not=0,$ for the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ to be true for all $z\in\overline{\mathbb…

This paper considers the problems of solving monotone variational inequalities with H\"older continuous Jacobians. By employing the knowledge of H\"older parameter $\nu$, we propose the $\nu$-regularized extra-Newton method within at most…

We start with some global Maxwellian function $M$, which is a stationary solution (with the constant total density $\rho$) of the Boltzmann equation, and we denote the number of the corresponding space variables by $n$. The notion of…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

By addressing a long-standing open problem, listed in a highly regarded collection of open questions in the field and described as a "worthwhile research project", this note extends Markov's theorem (Markoff, Math. Ann., 27:177-182, 1886)…

We consider the problem of estimating the multiplicity of a polynomial when restricted to the smooth analytic trajectory of a (possibly singular) polynomial vector field at a given point or points, under an assumption known as the…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Let $w_{\lambda}(t)=(1-t^2)^{\lambda-1/2}$, $\lambda>-1/2$, be the Gegenbauer weight function, and $\Vert\cdot\Vert$ denote the associated $L_2$-norm, i.e., $$ \Vert f\Vert:=\Big(\int_{-1}^{1}w_{\lambda}(t)\vert f(t)\vert^2\,dt\Big)^{1/2}.…

The {\em line sum optimization problem} asks for a $(0,1)$-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column…

We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…

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 study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let ${\M}_n({\Z})$ denote the monic polynomials of degree $n$ with integer coefficients. A {\it monic integer Chebyshev polynomial} $M_n…

First we consider the following problem which dates back to Chebyshev, Zolotarev and Achieser: among all trigonometric polynomials with given leading coefficients $a_0,...,a_l,$ $b_0,...,b_l \in \mathbb R$ find that one with least maximum…

In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…

We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.

In this article the solution of the special problem of the conditional extremum for the conjugate trigonometric polynomials is given. A possibility to apply this result to the problems of optimal stabilization of quasidynamic chaos in…

We consider generalized solutions of the Perona-Malik equation in dimension one, defined as all possible limits of solutions to the semi-discrete approximation in which derivatives with respect to the space variable are replaced by…

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

We consider the problem of finding the Perron-Frobenius eigenvector of a primitive matrix. Dividing each of the rows of the matrix by the sum of the elements in the row, the resulting new matrix is stochastic. We give a formula for the…