相关论文: Computability for Axiom A Polynomial Skew Products…

A polynomial skew product of C^2 is a map of the form f(z,w) = (p(z), q(z,w)), where p and q are polynomials, such that f is regular of degree d >= 2. For polynomial maps of C, hyperbolicity is equivalent to the condition that the closure…

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…

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 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.

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.

In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.

We study skew-product dynamics for a large class of finitely-generated semi--hyperbolic semigroups of rational maps acting on the Riemann sphere, which generalizes both the theory of iteration of a single rational map of a single complex…

For the class of polynomial skew products of C^2, we describe a rigorous computer algorithm which, for a given map F, will (1) build a model of the dynamics of F on its chain recurrent set, and (2) attempt to determine whether F is Axiom A.…

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…

Let $H^d$ be the set of all rational maps of degree $d\ge 2$ on the Riemann sphere which are expanding on Julia set. We prove that if $f\in H^d$ and all or all but one critical points (or values) are in the immediate basin of attraction to…

We consider polynomial maps of the form f(z,w) = (p(z),q(z,w)) that extend as holomorphic maps of CP^2. Mattias Jonsson introduces in (Math. Ann., 1999) a notion of connectedness for such polynomial skew products that is analogous to…

We investigate the dynamics of semigroups generated by polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. Moreover, we investigate the associated random dynamics of polynomials.…

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 analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

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…

We prove that for a polynomial diffeomorphism of C^2, uniform hyperbolicity on the set of saddle periodic points implies that saddle points are dense in the Julia set. In particular f satisfies Smale's Axiom A on C^2 .

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 explore the connected/disconnected dichotomy for the Julia set of polynomial automorphisms of C^2. We develop several aspects of the question, which was first studied by Bedford-Smillie. We introduce a new sufficient condition for the…

We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…