Related papers: Polynomials, roots, and interlacing

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.

Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…

The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the…

It is shown that if two hyperbolic polynomials have a particular factorization into quadratics, then their roots satisfy a power majorization relation whenever key coefficients in their factorizations satisfy a corresponding majorization…

Special polynomials associated with rational solutions of the second Painlev\'{e} equation and other members of its hierarchy are discussed. New approach, which allows one to construct each polynomial is presented. The structure of the…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, based on the presence or absence of positive roots of an auxiliary polynomial, but does not provide a method to verify its conditions or to…

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…

A polynomial knot is a smooth embedding $\kappa: \real \to \real^n$ whose components are polynomials. The case $n = 3$ is of particular interest. It is both an object of real algebraic geometry as well as being an open ended topological…