Related papers: Filled Julia sets with empty interior are computab…
Let $f$ be a rational map with degree $d\geq 2$ whose Julia set is connected but not equal to the whole Riemann sphere. It is proved that there exists a rational map $g$ such that $g$ contains a buried Julia component on which the dynamics…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…
We prove that Julia components of polynomials are generally small in diameter. For polynomials without irrationally neutral cycles, Fatou components are also typically small, even when the Julia set is not locally connected.
The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…
Since the 1980s, much progress has been done in completely determining which functions share a Julia set. The polynomial case was completely solved in 1995, and it was shown that the symmetries of the Julia set play a central role in…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
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…
In this paper we shall show that there exists L_0 such that for each even integer L >= L_0 there exists $c_1 \in \rz$ for which the Julia set of $z --> z^L + c_1$ has positive Lebesgue measure. This solves an old problem. Editor's note: In…
In this paper I prove that for a polynomial of degree $d$ with a Cantor Julia set $J$, the Julia set can be understood as the simplest possible quotiont of the one sided shift space $\Sigma_d$ with dynamics given by the shift. Here simplest…
We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a…
In this article, we provide the first theoretical framework guaranteeing that computers can, in principle, be used to analyze the parameter space of complex H\'{e}maps. More precisely, we obtain computability results for hyperbolic…
In general, little is known about the exact topological structure of Julia sets containing a Cremer point. In this paper we show that there exist quadratic Cremer Julia sets of positive area such that for a full Lebesgue measure set of…
In this work we study the backward filled Julia sets of a class of $p$-adic polynomial maps $f:\mathbb{Q}_p^2\longrightarrow \mathbb{Q}_p^2$ defined by $f(x,y)=(xy+c,x)$, where $c\in\mathbb{Q}_p$ is a $p$-adic number. In particular, if…
By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
For a sequence $(\lambda_n)$ of positive real numbers we consider the exponential functions $f_{\lambda_n} (z) = \lambda_n e^z$ and the compositions $F_n = f_{\lambda_n} \circ f_{\lambda_{n-1}} \circ ... \circ f_{\lambda_1}$. For such a…
This article deals with the question of local connectivity of the Julia set of polynomials and rational maps. It essentially presents conjectures and questions.
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.
The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…