Related papers: The Beauty of Roots

Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in $\{ -1,1\}$ are called Littlewood polynomials. By exploiting an algorithm developed…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

In fractal geometry, the main objects of study have been geometric objects with a global dimension that need not be integer valued. More recently, locally fractal objects, ones in which the dimension is a local property rather than a global…

Let $K$ be an algebraically closed field with an absolute value. This note gives an elementary proof of the classical result that the roots of a polynomial with coefficients in $K$ are continuous functions of the coefficients of the…

The examination of roots of constrained polynomials dates back at least to Waring and to Littlewood. However, such delicate structures as fractals and holes have only recently been found. We study the space of roots to certain integer…

The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

A Littlewood polynomial is a polynomial in $\mathbb{C}[z]$ having all of its coefficients in $\{-1,1\}$. There are various old unsolved problems, mostly due to Littlewood and Erd\H{o}s, that ask for Littlewood polynomials that provide a…

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

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

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…