Related papers: Root geometry of polynomial sequences I: Type $(0,…

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Let $f(x) \in \mathbb{C}[x]$ of degree $n$. We attach to $f$ a $\mathbb{C}$-vector space $W(f)$ which consists of complex polynomials $p(x)$ of degree at most $n - 2$ such that $f(x)$ divides $f"(x)p(x) - f'(x) p'(x)$. The space $W(f)$…

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the…

We define a total order, which we call rooted order, on minimal generating set of $J(P_n)^s$ where $J(P_n)$ is the cover ideal of a path graph on $n$ vertices. We show that each power of a cover ideal of a path has linear quotients with…

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…

To every integer monic polynomial of degree m can be associated a `replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite `alphabet' of size 2m. This rule applied iteratively on almost any…

We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…

In previous work, we proved that the continuous roots of a monic polynomial of degree $d$ whose coefficients depend in a $C^{d-1,1}$ way on real parameters belong to the Sobolev space $W^{1,q}$ for all $1\le q<d/(d-1)$. This is optimal. We…

The purpose of this note is to characterize those orthogonal polynomials sequences $(P_n)_{n\geq0}$ for which $$ \pi(x)\mathcal{D}_q P_n(x)=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\mathcal{D}_q$ is the Askey-Wilson…

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

We describe the limit zero distributions of sequences of polynomials with positive coefficients.

In this paper we study the geometry of the set of real square roots of $\pm I_2$. After some introductory remarks, we begin our study by deriving by quite elementary methods the forms of the real square roots of $\pm I_2$. We then discuss…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.