相关论文: Constructing Non-Computable Julia Sets

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.

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…

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 show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.

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 explore a class of quadratic polynomials having Siegel disks with unbounded type rotation numbers. We prove that any boundary point of Siegel disks of these polynomials is a Lebesgue density point of their filled-in Julia…

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…

Based on the weak expansion property of a long iteration of a family of quasi-Blaschke products near the unit circle established recently, we prove that the Julia sets of a number of transcendental entire functions with bounded type Siegel…

We prove the existence of quadratic polynomials having a Julia set with positive Lebesgue measure in three cases: the presence of a Cremer fixed point, the presence of a Siegel disk, the presence of infinitely many (satellite)…

Let $f_\theta(z)=e^{2\pi i\theta}z+z^2$ be the quadratic polynomial having an indifferent fixed point at the origin. For any bounded type irrational number $\theta\in\mathbb{R}\setminus\mathbb{Q}$ and any rational number $\nu\in\mathbb{Q}$,…

In this note we give answers to questions posed to us by J.Milnor and M.Shub, which shed further light on the structure of non-computable Julia sets.

Motivated by the work of Douady, Ghys, Herman and Shishikura on Siegel quadratic polynomials, we study the one-dimensional slice of the cubic polynomials which have a fixed Siegel disk of rotation number theta, with theta being a given…

We show that if a polynomial filled Julia set has empty interior, then it is computable.

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

We prove that a long iteration of rational maps is expanding near boundaries of bounded type Siegel disks. This leads us to extend Petersen's local connectivity result on the Julia sets of quadratic Siegel polynomials to a general case. A…

In this paper, we study rigidity of polynomials of arbitrary degree in the presence of neutral dynamics. Specifically, we focus on {non-renormalizable} (in the sense of Douady and Hubbard) complex polynomials of degree $d \geqslant 2$ that…

In the famous work by Buff and Ch\'eritat constructing quadratic Julia sets with positive area, the control of the shape of perturbed Siegel disks is a key technique. To do it, Buff and Ch\'eritat added a restrictive condition on rotation…

In this paper we explore by means of the method of Lagrangian descriptors the Julia sets arising from complex maps, and we analyze their underlying dynamics. In particular, we take a look at two classical examples: the quadratic mapping…

Consider a polynomial $f$ of degree $d \geq 2$ that has a Siegel disk $\Delta_f$ with a rotation number of bounded type. We prove that there does not exist a hedgehog containing $\Delta_f$. Moreover, if the Julia set $J_f$ of $f$ is…