Related papers: Tricomplex Distance Estimation for Filled-in Julia…
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…
In this article, we introduce the adapted inverse iteration method to generate bicomplex Julia sets associated to the polynomial map $w^2+c$. The result is based on a full characterization of bicomplex Julia sets as the boundary of a…
In this article, we give the exact interval of the cross section of the so called Mandelbric set generated by the polynomial $z^3+c$ where $z$ and $c$ are complex numbers. Following that result, we show that the Mandelbric defined on the…
In this article, we give the exact interval of the cross section of the Multibrot sets generated by the polynomial $z^p+c$ where $z$ and $c$ are complex numbers and $p \geq 2$ is an even integer. Furthermore, we show that the same…
In this article, we give the exact interval of the cross section of the Multibrot sets generated by the polynomial $z^p+c$ where $z$ and $c$ are complex numbers and $p > 2$ is an odd integer. Furthermore, we show that the same Multibrots…
This article focuses on the dynamics of the different tridimensional principal slices of the multicomplex Multibrot sets. First, we define an equivalence relation between those slices. Then, we characterize them in order to establish…
An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m…
Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…
We introduce "TriMap"; a dimensionality reduction technique based on triplet constraints, which preserves the global structure of the data better than the other commonly used methods such as t-SNE, LargeVis, and UMAP. To quantify the global…
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 show that the Julia set of quadratic maps with parameters in hyperbolic components of the Mandelbrot set is given by a transseries formula, rapidly convergent at any repelling periodic point. Up to conformal transformations, we obtain…
For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…
We identify the intersection of the multibrot set of $z^d+c$ with the rays ${\mathbb R}^+\omega$, where $\omega^{d-1}=\pm1$.
This manuscript introduces $J_3$-numbers, a seemingly missing three-dimensional intermediate between complex numbers related to points in the Cartesian coordinate plane and Hamilton's quaternions in the 4D space. The current development is…
In this article, we introduce the concept of normal families of bicomplex holomorphic functions to obtain a bicomplex Montel theorem. Moreover, we give a general definition of Fatou and Julia sets for bicomplex polynomials and we obtain a…
This chapter describes how to use intersection and closest-hit shaders to implement real-time visualizations of complex fractals using distance functions. The Mandelbulb and Julia Sets are used as examples.
Working within the polynomial quadratic family, we introduce a new point of view on bifurcations which naturally allows to see the seat of bifurcations as the projection of a Julia set of a complex dynamical system in dimension three. We…
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…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…