Related papers: On the complex zeros and the computational complex…
Given $H\subseteq \mathbb{C}$ two natural objects to study are the set of zeros of polynomials with coefficients in $H$, $$\{z\in \mathbb{C}: \exists k>0,\, \exists (a_n)\in H^{k+1}, \sum_{n=0}^{k}a_{n}z^n=0\},$$ and the set of zeros of…
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 show that almost all the zeros of any finite linear combination of independent characteristic polynomials of random unitary matrices lie on the unit circle. This result is the random matrix analogue of an earlier result by Bombieri and…
We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…
The main purpose of this paper is to present the generalization of the inequalities between the modulus of the polar derivative and the polynomial itself, depending on consideration of the zeros inside and outside of a closed disk and the…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…
I show that the zeros of the chromatic polynomials P_G(q) for the generalized theta graphs \Theta^{(s,p)} are, taken together, dense in the whole complex plane with the possible exception of the disc |q-1| < 1. The same holds for their…
We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
A polynomial homotopy is a family of polynomial systems, where the systems in the family depend on one parameter. If for one value of the parameter we know a regular solution, then what is the nearest value of the parameter for which the…
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…
In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…
Modularity is a quantity which has been introduced in the context of complex networks in order to quantify how close a network is to an ideal modular network in which the nodes form small interconnected communities that are joined together…
The derivative of a polynomial with all zeros on the unit circle has the zeros of its derivative on or inside the unit circle. It has been observed that in many cases the zeros of the derivative have a bimodal distribution: there are two…
We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…
Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the database research community. A fundamental problem on uncertain…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…