Related papers: Filled Julia sets with empty interior are computab…

We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

Let $f:\widehat{\mathbb{C}}\rightarrow \widehat{\mathbb{C}}$ be a hyperbolic rational map of degree $d \geq 2$, and let $J \subset \mathbb{C}$ be its Julia set. We prove that $J$ always has positive Fourier dimension. The case where $J$ is…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

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 investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

We show that exchangeable structures such as Polya urn model and Chinese restaurant process can be constructed from sets with a real number of elements. From this construction, the exchangeability of these structures becomes obvious and the…

This article gives a precise description of the Fatou sets and Julia sets of matrix-valued polynomials in $\mathcal{M}(2,\mathbb{C})$ in terms of the corresponding polynomials in $\mathbb{C}$. Further, we construct Green functions and…

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…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

Let $f$ be a polynomial-like mapping of the sphere of degree $d \geq 2$. We show that the Julia set $J(f)$ of $f$ cannot be the union of a finite number of proper indecomposable subcontinua. As a corollary, we prove that $J(f)$ is an…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

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

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Makienko's conjecture, a proposed addition to Sullivan's dictionary, can be stated as follows: The Julia set of a rational function R has buried points if and only if no component of the Fatou set is completely invariant under the second…

For a sequence of complex parameters $\{c_n\}$ we consider the compositions of functions $f_{c_n} (z) = z^2 + c_n$, which is the non-autonomous version of the classical quadratic dynamical system. The definitions of Julia and Fatou sets are…

We present new rectification theorems of degenerate quasi-conformal structures that give a meaning to quotients of Riemann surfaces with empty interior "fundamental domains". These techniques are used to define the unique renormalization of…

Let G be a semigroup of rational functions of degree at least two, under composition of functions. Suppose that G contains two polynomials with non-equal Julia sets. We prove that the smallest closed subset of the Riemann sphere which…