Related papers: Extremal problems for polynomials with real roots

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

Let $\mathcal{H}_{n,d} := \mathbb{R}[x_1$,$\ldots$, $x_n]_d$ be the set of all the homogeneous polynomials of degree $d$, and let $\mathcal{H}_{n,d}^s := \mathcal{H}_{n,d}^{\mathfrak{S}_n}$ be the subset of all the symmetric polynomials.…

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

In the paper we study the distribution of the discriminant $D(P)$ of polynomials $P$ from the class $\mathcal{P}_{n}(Q)$ of all integer polynomials of degree $n$ and height at most $Q$. We evaluate the asymptotic number of polynomials $P\in…

The article is concerned with polynomials $g(x)$ whose graphs are "partially packed" between two horizontal tangent lines. We assume that most of the local maximum points of $g(x)$ are on the first horizontal line, and most of the local…

The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…

We consider extremal polynomials with respect to a Sobolev-type $p$-norm, with $1<p<\infty$ and measures supported on compact subsets of the real line. For a wide class of such extremal polynomials with respect to mutually singular measures…

We discuss the problem of finding optimal exponents in Diophantine estimates involving one real number and, in some cases where such an exponent is known, present some properties of the corresponding extremal numbers.

Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

Let $x_1$ and $x_k$ be the least and the largest zeros of the Laguerre or Jacobi polynomial of degree $k.$ We shall establish sharp inequalities of the form $x_1 <A, x_k >B,$ which are uniform in all the parameters involved. Together with…

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

We construct new examples of exceptional Hahn and Jacobi polynomials. Exceptional polynomials are orthogonal polynomials with respect to a measure which are also eigenfunctions of a second order difference or differential operator. The most…

We provide a new result on the existence of extremal solutions for second-order Dirichlet problems with deviation argument. As a novelty in this work, the nonlinearity need not be continuous or monotone. In order to obtain this new result,…

We study the number of real roots of a Kostlan random polynomial of degree $d$ in one variable. More generally, we are interested in the distribution of the counting measure of the set of real roots of such a polynomial. We compute the…

An open problem about two new families of orthogonal polynomials was posed by Alhaidari. Here we will identify one of them as Wilson polynomials. The other family seems to be new but we show that they are discrete orthogonal polynomials on…

Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…

We initiate a classification of complex polynomials f of degree d having the top Betti number of the general fibre close to the maximum. We find a range in which the polynomial must have isolated singularities and another range where it may…