Related papers: Poly-time Computability of the Feigenbaum Julia se…
Since the 1980s, much progress has been done in completely determining which functions share a Julia set. The polynomial case was completely solved in 1995, and it was shown that the symmetries of the Julia set play a central role in…
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…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. The Julia set of such a semigroup may not be connected in general. We…
We prove a priori bounds for Feigenbaum quadratic polynomials, i.e., infinitely renormalizable polynomials $f_c: z\mapsto z^2+c$ of bounded type. It implies local connectivity of the corresponding Julia sets $J(f_c)$ and MLC (local…
Let $ R $ be a rational map with totally disconnected Julia set $ J(R). $ If the postcritical set on $ J(R) $ contains a non-persistently recurrent (or conical) point, then we show that the map $ R $ can not be a structurally stable map.
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…
It has been known since Julia that polynomials commuting under composition have the same Julia set. More recently in the works of Baker and Eremenko, Fern\'andez, and Beardon, results were given on the converse question: When do two…
In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…
A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…
In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…
We prove that every wandering exposed Julia component of a rational map is to a singleton, provided that each wandering Julia component containing critical points is non-recurrent. Moreover, we show that the Julia set contains only finitely…
We construct a combinatorial model of the Julia set of the endomorphism $f(z, w)=((1-2z/w)^2, (1-2/w)^2)$ of $PC^2$.
We show that if $P$ is a quadratic polynomial with a fixed Cremer point and Julia set $J$, then for any monotone map $\ph:J\to A$ from $J$ onto a locally connected continuum $A$, $A$ is a single point.
The long-standing problem of existence of nowhere dense rational Julia set with positive area has been solved by an example in quadratic polynomials by Buff and Ch\'eritat. Since then many efforts have been devoted to finding out new…
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…
The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…
By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, 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…