Related papers: Piecewise interlacing zeros of polynomials

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Two theorems on the asymptotic distribution of zeros of sequences of analytic functions are proved. First one relates the asymptotic behavior of zeros to the asymptotic behavior of coefficients. Second theorem establishes a relation between…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

We investigate interlacing properties of zeros of Laguerre polynomials $ L_{n}^{(\alpha)}(x)$ and $ L_{n+1}^{(\alpha +k)}(x),$ $ \alpha > -1, $ where $ n \in \mathbb{N}$ and $ k \in {\{ 1,2 }\}$. We prove that, in general, the zeros of…

In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…

In this paper, we introduce polynomials (in $t$) of signed relative derangements that track the number of signed elements. The polynomials are clearly seen to be in a sense symmetric. Note that relative derangements are those without any…

In this paper we study asymptotic distributions associated to piecewise quasi-polynomials. The main result obtained here is used in another paper of the authors "The equivariant index of twisted Dirac operators and semi-classical limits".

An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…

We raise a question on the existence of continuous roots of families of monic polynomials (by the root of a family of polynomials we mean a function of the coefficients of polynomials of a given family that maps each tuple of coefficients…

We show that the dilogarithm has at most one zero on each branch, that each zero is close to a root of unity, and that they may be found to any precision with Newton's method. This work is motivated by applications to the asymptotics of…

The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…

The relationship between nonnegative polynomials and sums of squares is one of the central questions in real algebraic geometry. A modern approach is to look at nonnegative polynomials and sums of squares on a real variety. We survey the…

In this paper, we study distribution of the zeros of the Alexander polynomials of knots and links in S^3. We call a knot or link "real stable" (resp. "circular stable") if all the zeros of its Alexander polynomial are real (resp. unit…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously…

In this paper we present a new semilocal convergence theorem from data at one point for the Weierstrass iterative method for the simultaneous computation of polynomial zeros. The main result generalizes and improves all previous ones in…

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…