On computational complexity of Cremer Julia sets
We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
arXiv subjects
Publications and source records attributed to Michael Yampolsky.
We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
We show that the dynamics of sufficiently dissipative semi-Siegel complex Hénon maps with golden-mean rotation number is not $J$-stable in a very strong sense. By the work of Dujardin and Lyubich, this implies that the Newhouse phenomenon occurs for a dense $G_δ$ set of parameters in this family. Another consequence is that the Julia sets of such maps are disconnected for a dense set of parameters.
We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched coverings of the sphere are Thurston equivalent.
We give several new characterizations of Caratheodory convergence of simply connected domains. We then investigate how different definitions of convergence generalize to the multiply-connected case.
As was recently shown by the first author and others, golden-mean Siegel disks of sufficiently dissipative complex quadratic Hénon maps are bounded by topological circles. In this paper we investigate the geometric properties of such curves, and demonstrate that they cannot be $C^1$-smooth.
We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.
We construct a renormalization operator which acts on analytic circle maps whose critical exponent $α$ is not necessarily an odd integer $2n+1$, $n\in\mathbb N$. When $α=2n+1$, our definition generalizes cylinder renormalization of analytic critical circle maps. In the case when $α$ is close to an odd integer, we prove hyperbolicity of renormalization for maps of bounded type. We use it to prove universality and $C^{1+α}$-rigidity for such maps.
We define an analytic setting for renormalization of unimodal maps with an arbitrary critical exponent. We prove the global Hyperbolicity of Renormalization conjecture for unimodal maps of bounded type with a critical exponent which is sufficiently close to an even integer.
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 external rays impressions.
We show that there exist real quadratic maps of the interval whose attractors are computationally intractable. This is the first known class of such natural examples.
We show the existence of computable complex numbers $λ$ for which the bifurcation locus of the one parameter complex family $f_{b}(z) = λz + b z^{2} + z^{3}$ is not Turing computable.
In this paper we generalize renormalization theory for analytic critical circle maps with a cubic critical point to the case of maps with an arbitrary odd critical exponent by proving a quasiconformal rigidity statement for renormalizations of such maps.
We provide a computer-assisted proof of one of the central open questions in one-dimensional renormalization theory -- universality of the golden-mean Siegel disks. We further show that for every function in the stable manifold of the golden-mean renormalization fixed point the boundary of the Siegel disk is a quasicircle which coincides with the closure of the critical orbit, and that the dynamics on the boundary of the Siegel disk is rigid. Furthermore, we extend the renormalization from one-dimensional analytic maps with a golden-mean Siegel disk to two-dimensional dissipative Hénon-like maps and show that the renormalization hyperbolicity result still holds in this setting.
We study the renormalization operator of circle homeomorphisms with a break point and show that it possesses a hyperbolic horseshoe attractor.
We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.
We discuss computability of impressions of prime ends of compact sets. In particular, we construct quadratic Julia sets which possess explicitly described non-computable impressions.
The key result in the present paper is a direct analogue of the celebrated Thurston's Theorem for marked Thurston maps with parabolic orbifolds. Combining this result with previously developed techniques, we prove that every Thurston map can be constructively geometrized in a canonical fashion. As a consequence, we give a partial resolution of the general problem of decidability of Thurston equivalence of two postcritically finite branched covers of the two-sphere.
Conformal Riemann mapping of the unit disk onto a simply-connected domain $W$ is a central object of study in classical Complex Analysis. The first complete proof of the Riemann Mapping Theorem given by P. Koebe in 1912 is constructive, and theoretical aspects of computing the Riemann map have been extensively studied since. Carath{é}odory Theory describes the boundary extension of the Riemann map. In this paper we develop its constructive version with explicit complexity bounds.