Mark Braverman, Michael Yampolsky
We completely characterize the conformal radii of Siegel disks in the family $$P_θ(z)=e^{2πiθ}z+z^2,$$ corresponding to {\bf computable} parameters $θ$. As a consequence, we constructively produce quadratic polynomials with {\bf non-computable} Julia sets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 show that if a polynomial filled Julia set has empty interior, then it is computable.
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.
Parabolic Julia Sets are Polynomial Time Computable
本文证明了有理函数的抛物线Julia集在多项式时间内是局部可计算的。
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.
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 polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.
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.
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 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.
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 polynomial is always 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 real parameter $c$ such that the computational complexity of computing $J_c$ with $n$ bits of precision is higher than $T(n)$. This is the first known class of real parameters with a non poly-time computable Julia set.
We give an alternative way to construct an entire function with quasiconformal surgery so that all its Fatou components are quasi-circles but the Julia set is non-locally connected.
A dynamical algorithm to compute hyperbolic Julia sets in polynomial time
本文提出一种动态算法，用于在多项式时间内计算复多项式的双曲Julia集，并确立其下可计算性。
According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia sets: there exist cubic polynomials whose Julia set is a locally connected dendrite with a branching point which is neither preperiodic nor precritical. In this article, we reprove this result, constructing such cubic polynomials as limits of cubic polynomials for which one critical point eventually maps to the other critical point which eventually maps to …
Ulam meets Turing: constructing quadratic maps with non-computable SRB measures
本文证明即使对最简单的 logistic 映射，Monte Carlo 等数值方法也可能失效：存在可计算参数使几乎每条轨道具有相同的渐近统计分布，但该极限分布不可 Turing 计算。
We continue the study of constructing invariant Laplacians on Julia sets, and studying properties of their spectra. In this paper we focus on two types of examples: 1) Julia sets of cubic polynomials $z^3 + c$ with a single critical point; 2) formal matings of quadratic Julia sets. The general scheme introduced in earlier papers in this series involves realizing the Julia set as a circle with identifications, and attempting to obtain the Laplacian as a renormalized limit of graph Laplacians on graphs derived form the circle with identifications model. In the case of cubic Julia sets the detail…
Computability of Julia sets for complex Hénon maps: The role of attracting and neutral cycles
该研究将复Hénon映射Julia集的可计算性从双曲情形扩展到含吸引盆地的非双曲情形，基于鞍点稳定流形的算法实现，同时指出中性动力学下高维存在部分类似一维的可计算性二分法。
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are computable points which are not contained in infinitely many $A_{i}$. As a consequence of this we obtain the existence of computable points which follow the \emph{typical statistical behavior} of a dynamical system (they satisfy the Birkhoff theorem) for a large class of systems, having computable invariant measure and a certain ``logarithmic'' speed of convergen…
Bounded Fatou and Julia components of meromorphic functions
本文完整刻画亚纯函数中有界 Fatou 分支与 Julia 分支的拓扑特征，并借助逼近理论构造含游荡连续统的亚纯函数给出证明。
On the area rate of perturbed Siegel disks
本文研究了扰动Siegel盘的面积率，证明了在构造具有正面积的二次Julia集时，Buff和Chéritat对旋转数添加的限制性条件可以被删除，从而能够构造出更多此类Julia集。
In this paper we study two classes of meromorphic functions previously studied by Mayer, Kotus, and Urbański. In particular we estimate a lower bound for the Julia set and the set of escaping points for non-autonomous additive and affine perturbations of functions from these classes. For particular classes we are able to calculate these dimensions exactly. In these cases, we are able to reinterpret our results to show that the Hausdorff dimension of the set of points in the Julia set which escape to infinity is stable under sufficiently small additive perturbations. We accomplish this by const…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。