Related papers: On the dynamics of Stirling's iterative root-findi…

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 prove an analogue of Hilbert's Tenth Problem for complex meromorphic functions. More precisely, we prove that the set of integers is positive existentially definable in fields of complex meromorphic functions in several variables over…

Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…

Under some mild assumptions, an orientation-preserving branched covering map of marked $2$-spheres induces a pullback map between the corresponding Teichm\"uller spaces. By analyzing the associated pushforward operator acting on integrable…

For the family of complex rational functions of the form R(z)= z^n + a/z^n+b, known as "Generalized McMullen maps", for non-zero a, and integer n fixed and at least 3, we describe the apparent phenomena of baby Julia sets in parameter space…

We provide a natural canonical decomposition of postcritically finite rational maps with non-empty Fatou sets based on the topological structure of their Julia sets. The building blocks of this decomposition are maps where all Fatou…

In root finding and optimization, there are many cases where there is a closed set $A$ one likes that the sequence constructed by one's favourite method will not converge to A (here, we do not assume extra properties on $A$ such as being…

In this document, as far as the authors know, an approximation to the zeros of the Riemann zeta function has been obtained for the first time using only derivatives of constant functions, which was possible only because a fractional…

For each positive prime integer $p$ we construct a standard graded $F$-rational ring $R$, over a field $K$ of characteristic $p$, such that $R\otimes_K\overline{K}$ is not $F$-rational. By localizing we obtain a flat local homomorphism $(R,…

We investigate the behavior of trajectories of a $(3,2)$-rational $p$-adic dynamical system in the complex $p$-adic filed ${\mathbb C}_p$, when there exists a unique fixed point $x_0$. We study this $p$-adic dynamical system by dynamics of…

We obtain an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly expanding rational maps without any smoothness…

This article concerns the iteration of quasiregular mappings on $\mathbb{R}^d$ and entire functions on $\mathbb{C}$. It is shown that there are always points at which the iterates of a quasiregular map tend to infinity at a controlled rate.…

We study the Chebyshev-Halley family of root finding algorithms from the point of view of holomorphic dynamics. Numerical experiments show that the speed of convergence to the roots may be slower when the basins of attraction are not simply…

Let $X$ be a compact K\"ahler manifold and let $f:X\rightarrow X$ be a dominant rational map which is 1-stable. Let $\lambda_1$ and $\lambda_2$ be the first and second dynamical degrees of $f$. If $\lambda_1^2>\lambda_2$, then we show that…

Let $P$ and $Q$ be two polynomials in two variables with coefficients in an algebraic closed field of characteristic zero. We consider the rational function $f=P/Q$. For an indeterminacy point $\text{x}$ of $f$ and a value $c$, we compute…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…