Related papers: Real quadratic Julia sets can have arbitrarily hig…
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…
Reduce and control complexity is an essential practice in software design. Cyclomatic complexity (CC) is one of the most popular software metrics, applied for more than 40 years. Despite CC is an interesting metric to highlight the number…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
In this article, we study the set of parameters $c \in \mathbb{C}$ for which two given complex numbers $a$ and $b$ are simultaneously preperiodic for the quadratic polynomial $f_{c}(z) = z^{2} +c$. Combining complex-analytic and arithmetic…
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p$…
We prove that for meromorphic maps with logarithmic tracts (e.g. entire or meromorphic maps with a finite number of poles from class $\mathcal B$), the Julia set contains a compact invariant hyperbolic Cantor set of Hausdorff dimension…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
We investigate under which dynamical conditions the Julia set of a quadratic rational map is a Sierpi\'{n}ski curve
We study a family of birational maps of smooth affine quadric 3-folds, {over the complex numbers}, of the form $x_1x_4-x_2x_3=$ constant, which seems to have some (among many others) interesting/unexpected characters: a) they are…
In this paper we mainly investigate the radial distribution of Julia set of derivatives of entire solutions of some complex linear differential equations. Under certain conditions, we find the lower bound of it which improve some recent…
We study algebraic relations among postcritically finite (PCF) parameters in the family $f_c(z) = z^2 + c$. Ghioca, Krieger, Nguyen and Ye proved that an algebraic curve in $\mathbb{C}^2$ contains infinitely many PCF pairs $(c_1, c_2)$ if…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
In general, little is known about the exact topological structure of Julia sets containing a Cremer point. In this paper we show that there exist quadratic Cremer Julia sets of positive area such that for a full Lebesgue measure set of…
This article deals with the question of local connectivity of the Julia set of polynomials and rational maps. It essentially presents conjectures and questions.
We describe an algorithm for distinguishing hyperbolic components in the parameter space of quadratic rational maps with a periodic critical point. We then illustrate computer images of the hyperbolic components of the parameter spaces V1 -…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
We prove that a polynomial Julia set which is a finitely irreducible continuum is either an arc or an indecomposable continuum. For the more general case of rational functions, we give a topological model for the dynamics when the Julia set…
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…
Let $f$ be a birational map of ${\bf C}^d$, and consider the degree complexity, or asymptotic degree growth rate $\delta(f)=\lim_{n\to\infty}({\rm deg}(f^n))^{1/n}$. We introduce a family of elementary maps, which have the form $f=L\circ…
N-body simulations and trajectory analysis rely on the calculation of attributes that depend on pairwise particle distances within a cutoff. Interparticle potential energies, forces, distribution functions, neighbor lists, and…