Related papers: Computability properties of hyperbolic complex H\'…
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…
In this paper we study the computability of the stable and unstable manifolds of a hyperbolic equilibrium point. These manifolds are the essential feature which characterizes a hyperbolic system. We show that (i) locally these manifolds can…
For complex parameters a,c, we consider the Henon mapping H_{a,c}: C^2 -> C^2 given by (x,y) -> (x^2 +c -ay, x), and its Julia set, J. In this paper, we describe a rigorous computer program for attempting to construct a cone field in the…
Hyperbolic Julia sets of complex polynomials are known to be computable in polynomial time due to pioneering work of Braverman in 2005 (10.1016/j.entcs.2004.06.031). In this paper, we present an alternative method for establishing poly-time…
We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a complex polynomial map is expansive on a given neighborhood of its Julia set. We show construction of such a metric proves the…
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…
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…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
Let $f:\mathbb{C}\sp n\to\mathbb{C}\sp n$, $n\geq2$, be a biholomorphism and let $\Lambda\subseteq \mathbb{C}\sp n$ be a compact $f$-invariant set such that $f|\Lambda$ is partially hyperbolic. We give equivalent conditions to hyperbolicity…
For a hyperbolic polynomial automorphism of C^2 with a disconnected Julia set, and under a mild dissipativity condition, we give a topological description of the components of the Julia set. Namely, there are finitely many "quasi-solenoids"…
We prove some new continuity results for the Julia sets $J$ and $J^{+}$ of the complex H\'enon map $H_{c,a}(x,y)=(x^{2}+c+ay, ax)$, where $a$ and $c$ are complex parameters. We look at the parameter space of dissipative H\'enon maps which…
We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We formulate and prove a Jakobson-Benedicks-Carleson type theorem on the occurence of nonuniform hyperbolicity (stochastic dynamics) in families of one-dimensional maps, based on "computable starting conditions" and providing "explicit,…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We study the dynamics of polynomial maps on the boundary of the central hyperbolic component $\mathcal H_d$. We prove the local connectivity of Julia sets and a rigidity theorem for maps on the regular part of $\partial\mathcal H_d$. Our…
In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.
It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has…
We consider polynomial maps $f:\C\to\C$ of degree $d\ge 2$, or more generally polynomial maps from a finite union of copies of $\C$ to itself which have degree two or more on each copy. In any space $\p^{S}$ of suitably normalized maps of…