Related papers: The Inverse Iteration Method for Julia Sets in the…
A generalization of the filled-in Julia set is presented using the multicomplex numbers and an algorithm is presented to visualize these sets in the tridimensional space. There are many ways to visualize these higher dimensional fractals…
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;…
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…
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…
In this article, we present a distance estimation formula that can be used to ray trace 3D slices of the filled-in Julia sets and the Multibrot sets generated by the tricomplex polynomials of the form $\eta^p+c$ where $p$ is any integer…
We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-M\"obius element) to a class of M\"obius semigroups which includes certain settings…
In this paper, we consider random iterations of polynomial maps $z^2 +c_n$ where $c_n$ are complex-valued independent random variables following the uniform distribution on the closed disk with center $c$ and radius $r$. The aim of this…
In this paper we explore by means of the method of Lagrangian descriptors the Julia sets arising from complex maps, and we analyze their underlying dynamics. In particular, we take a look at two classical examples: the quadratic mapping…
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…
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…
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…
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…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…
We present an open-source Julia-based software toolkit for solving the phase problem using dual-space iterative algorithms. The toolkit is specifically designed for aperiodic crystals and quasicrystals, supporting general space group…
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…
The generation of fractals and study of the dynamics of polynomials is one of the emerging and interesting field of research nowadays. We introduce in this paper the dynamics of polynomials z^ n - z + c = 0 for n>=2 and applied Jungck…
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$.
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…