Related papers: Iterative Roots of Multifunctions
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
For PM functions of height 1, the existence of continuous iterative roots of any order was obtained under the characteristic endpoints condition. This raises an open problem about iterative roots without this condition, called…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
We prove the sufficient conditions for convergence of a certain iterative process of order 2 for solving nonlinear functional equations, which does not require inverting the derivative. We translate and detail our results for a system of…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…
Let G = (V;E) be a simple graph. We consider domination polynomial, matching polynomial and edge cover polynomial of G. Graphs which their polynomials have few roots can give sometimes a very surprising information about the structure of…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…
A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…
A precise meaning is given to the notion of continuous iteration of a mapping. Usual discrete iterations are extended into a dynamical flow which is a homotopy of them all. The continuous iterate reveals that a dynamical map is formend by…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that…
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
We study a map that sends a monic degree n complex polynomial f(x) without multiple roots to the collection of n values of its derivative at the roots of f(x). We give an answer to a question posed by Ju.S. Ilyashenko.