Related papers: Computability of the Julia set. Nonrecurrent criti…
We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…
Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…
Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…
Let $X$ be a variety defined over a number field and $f$ be a dominant rational self-map of $X$ of infinite order. We show that $X$ admits many algebraic points which are not preperiodic under $f$. If $f$ were regular and polarized, this…
In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities…
Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…
Bicritical rational functions -- those with precisely two critical points -- include the well-studied families of unicritical polynomials and quadratic rational functions. In this article we lay out general foundations for studying…
Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…
We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that…
The object of the paper is to characterize gasket Julia sets of rational maps that can be uniformized by round gaskets. We restrict to rational maps without critical points on the Julia set. Under these conditions, we prove that a Julia set…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
In this paper, we prove that a postcritically finite rational map with non-empty Fatou set is Thurstion equivalent to an expanding Thurston map if and only if its Julia set is homeomorphic to the standard Sierpinski carpet
For an infinitely renormalizable quadratic map $f_c: z\mapsto z^2+c$ with the sequence of renormalization periods ${k_m}$ and rotation numbers ${t_m=p_m/q_m}, we prove that if $\limsup k_m^{-1}\log |p_m|>0$, then the Mandelbrot set is…
In this paper, we consider the problem of determining the \emph{exact} number of periodic orbits for polynomial planar flows. This problem is a variant of Hilbert's 16th problem. Using a natural definition of computability, we show that the…
For the family of quadratic rational functions having a $2$-cycle of bounded type Siegel disks, we prove that each of the boundaries of these Siegel disks contains at most one critical point. In the parameter plane, we prove that the locus…
We investigate the connection between the instability of rational maps and summability methods applied to the spectrum of a critical point on the Julia set of a given rational map.
In this paper we discuss the mathematical background and the computational aspects which underly the implementation of a collection of Julia functions in the MatrixPencils package for the determination of structural properties of polynomial…
For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…