Related papers: Parabolic Julia Sets are Polynomial Time Computabl…

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…

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 propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.

One of the main questions in the field of complex dynamics is the question whether the Mandelbrot set is locally connected, and related to this, for which maps the Julia set is locally connected. In this paper we shall prove the following…

For a class of polynomial maps of one variable with a parabolic fixed points and degrees bigger than $21$, the parabolic renormalization is introduced based on Fatou coordinates and horn maps, and a type of maps which are invariant under…

Consider the parameter space $\mathcal{P}_{\lambda}\subset \mathbb{C}^{2}$ of complex H\'enon maps $$ H_{c,a}(x,y)=(x^{2}+c+ay,ax),\ \ a\neq 0 $$ which have a semi-parabolic fixed point with one eigenvalue $\lambda=e^{2\pi i p/q}$. We give…

Let $f:z\mapsto z^2+c$ be a quadratic polynomial whose Julia set $J$ is locally-connected of the set of biaccessible points in $J$ is zero except when $f(z)=z^2-2$ is the Chebyshev quadratic polynomial for which the corresponding measure is…

The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…

The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…

Several sets of quaternionic functions are described and studied with respect to hyperholomorphy, addition and (non commutative) multiplication, on open sets of $\mathbb H$. The aim is to get a local function theory.

We prove that Julia components of polynomials are generally small in diameter. For polynomials without irrationally neutral cycles, Fatou components are also typically small, even when the Julia set is not locally connected.

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…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

We prove the existence of Cantor Julia sets with Hausdorff dimension two. In particular, such examples can be found in cubic polynomials. The proof is based on the characterization of the parameter spaces and dynamical planes of cubic…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

We prove that every wandering Julia component of cubic rational maps eventually has at most two complementary components.

We construct Feigenbaum quadratic polynomials whose Julia sets have positive Lebesgue measure. They provide first examples of rational maps for which the hyperbolic dimension is different from the Hausdorff dimension of the Julia set. The…

We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…

The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…

We show that on real algebraic sets algebraically constructible functions coincide with the finite sums of signs of polynomials. Then we give some applications.