Related papers: Real quadratic Julia sets can have arbitrarily hig…
In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant…
The goal of this article is to study a rigidity property of Julia sets of certain classes of automorphisms in $\mathbb{C}^k$, $k \ge 3.$ First, we study the relation between two polynomial shift-like maps in $\mathbb{C}^k$, $k \ge 3$, that…
We prove that a nonempty, proper subset $S$ of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if $S$ is bounded and $\hat{\mathbb{C}} \setminus \textrm{int}(S)$ is connected. The proof…
For the family of complex rational functions of the form R(z)= z^n + a/z^n+b, known as "Generalized McMullen maps", for non-zero a, and integer n fixed and at least 3, we describe the apparent phenomena of baby Julia sets in parameter space…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for $\alpha$ fixed, maps $f_c$ which have the following form (in polar coordinates):…
Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…
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…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
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…
We study the higher (or sequential) topological complexity $\mathrm{TC}_s$ of manifolds with abelian fundamental group. We give sufficient conditions for $\mathrm{TC}_s$ to be non-maximal in both the orientable and non-orientable cases. In…
Fractals offer the ability to generate fascinating geometric shapes with all sorts of unique characteristics (for instance, fractal geometry provides a basis for modelling infinite detail found in nature). While fractals are non-euclidean…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We give three families of parabolic rational maps and show that every Cantor set of circles as the Julia set of a non-hyperbolic rational map must be quasisymmetrically equivalent to the Julia set of one map in these families for suitable…
Hyperbolic numbers are a variation of complex numbers, but their dynamics is quite different. The hyperbolic Mandelbrot set for quadratic functions over hyperbolic numbers is simply a filled square, and the filled Julia set for hyperbolic…
We prove some new continuity results for the Julia sets $J$ and $J^{+}$ of the complex H\'enon map $H_{c,a}(x,y)=(x^{2}+c+ay, ax)$, where $a$ and $c$ are complex parameters. We look at the parameter space of dissipative H\'enon maps which…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in…
Our main result states that, under an exponential map whose Julia set is the whole complex plane, on each piecewise smooth Jordan curve there is a point whose orbit is dense. This has consequences for the boundaries of nice sets, used in…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…