Related papers: Compatibility of Real-Rooted Polynomials with Mixe…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

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…

We prove a generalization of the Shapiro-Shapiro conjecture on Wronskians of polynomials, allowing the Wronskian to have complex conjugate roots. We decompose the real Schubert cell according to the number of real roots of the Wronski map,…

We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…

Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

The signature of a rectifiable path is a tensor series in the tensor algebra whose coefficients are definite iterated integrals of the path. The signature characterises the path up to a generalised form of reparametrisation. It is a…

We study the correspondence between equivalence classes of pairs consisting of real semisimple Lie algebras and their Cartan subalgebras and involutions of the corresponding root system. This can be graphically described by introducing…

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

We consider univariate real polynomials with all roots real and with two sign changes in the sequence of their coefficients which are all non-vanishing. One of the changes is between the linear and the constant term. By Descartes' rule of…

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of…

Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It generalizes some well-known graph polynomials such as the…

We are interested in irrationality of roots for seven important families of polynomials : Tchebichef polynomials, Legendre polynomials, Laguerre polynomials, Hermite polynomials, Bessel polynomials, Bernoulli polynomials and Euler…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

The fact that a real univariate polynomial misses some real roots is usually overcame by considering complex roots, but the price to pay for, is a complete lost of the sign structure that a set of real roots is endowed with (mutual position…

We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…

This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…

We define a special sort of weighted oriented graphs, signed quivers. Each of these yields a symmetric quiver, i.e., a quiver endowed with an involutive anti-automorphism and the inherited signs. We develop a representation theory of…