Related papers: Real quadratic Julia sets can have arbitrarily hig…

We study the dynamics of the family $f_c(x, y)= (xy+c, x)$ of endomorphisms of $\mathbb{R}^2$ and $\mathbb{C}^2$, where $c$ is a real or complex parameter. Such maps can be seen as perturbations of the map $f_0(x,y)=(xy,x)$, which is a…

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…

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…

Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…

Let $ R $ be a rational map with totally disconnected Julia set $ J(R). $ If the postcritical set on $ J(R) $ contains a non-persistently recurrent (or conical) point, then we show that the map $ R $ can not be a structurally stable map.

In this work, we study the non-autonomous dynamics generated by random iterations of the cubic family of the form $z^3 + cz$. The parameter sequence is chosen randomly from a bounded Borel subset of $\mathbb{C}$. We investigate topological…

We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…

Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…

This will is an expository description of quadratic rational maps. Sections 2 through 6 are concerned with the geometry and topology of such maps. Sections 7--10 survey of some topics from the dynamics of quadratic rational maps. There are…

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

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 consider sequences of compositions of quadratic polynomials $f_{c_n} (z) = z^2 + c_n$. For such sequences one can naturally generalize the definitions of the Julia set and basin of infinity from the autonomous case. In this setting the…

This paper studies quasiconformal non-equivalence of Julia sets and limit sets. We proved that any Julia set is quasiconformally different from the Apollonian gasket. We also proved that any Julia set of a quadratic rational map is…

We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…

We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…

Let $f:z\mapsto z^2+c$ be a quadratic polynomial whose Julia set $J$ is locally-connected of the set of biaccessible points in $J$ is zero except when $f(z)=z^2-2$ is the Chebyshev quadratic polynomial for which the corresponding measure is…

We study complex one-dimensional parameter slices in a three-parameter family of rational maps with two free critical points, obtained by imposing the existence of periodic orbits with prescribed multipliers. Using explicit…

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

An important question is to describe topological conjugacy classes of dynamical systems. Here we show that within the space of real analytic one-dimensional maps with critical points of prescribed order, the conjugacy class of a map is a…

For the family of complex rational functions known as "Generalized McMullen maps", F(z) = z^n + a/z^n+b, for complex parameters a and b, with a nonzero, and any integer n at least 3 fixed, we reveal, and provide a combinatorial model for,…