Related papers: Computability properties of hyperbolic complex H\'…
Compact locally maximal hyperbolic sets are studied via geometrically defined functional spaces that take advantage of the smoothness of the map in a neighborhood of the hyperbolic set. This provides a self-contained theory that not only…
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 -…
Let $f:\hat{\mathbb C}\to\hat{\mathbb C}$ be a hyperbolic rational map of degree $d\ge2$ on the Riemann sphere. We give several conditions which are equivalent to the condition for the Julia set $J_f$ to be a Cantor set. It has been known…
Hypergraphs are useful mathematical representations of overlapping and nested subsets of interacting units, including groups of genes or brain regions, economic cartels, political or military coalitions, and groups of products that are…
Many authors have studied the dynamics of hyperbolic transcendental entire functions; these are those for which the postsingular set is a compact subset of the Fatou set. Equivalenty, they are characterized as being expanding.…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
We study the conformal capacity by using novel computational algorithms based on implementations of the fast multipole method, and analytic techniques. Especially, we apply domain functionals to study the capacities of condensers $(G,E)$…
We give a new proof of a theorem of Hubbard-Oberste-Vorth [HOV2] for H\'enon maps that are perturbations of a hyperbolic polynomial and recover the Julia set $J^{+}$ inside a polydisk as the image of the fixed point of a contracting…
In this paper we investigate the perturbation properties of rational Misiurewicz maps, when the Julia set is the whole sphere (the other case is treated in [1]). In particular, we show that if f is a Misiurewicz map and not a flexible…
We consider the issue of computability at the most fundamental level of physical reality: the Planck scale. To this aim, we consider the theoretical model of a quantum computer on a non commutative space background, which is a computational…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
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…
Many high-dimensional and large-volume data sets of practical relevance have hierarchical structures induced by trees, graphs or time series. Such data sets are hard to process in Euclidean spaces and one often seeks low-dimensional…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
An algorithm is presented for numerical computation of choreographies in spaces of constant negative curvature in a hyperbolic cotangent potential, extending the ideas given in a companion paper for computing choreographies in the plane in…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
We show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
It is known that the disconnected Julia set of any polynomial map does not contain buried Julia components. But such Julia components may arise for rational maps. The first example is due to Curtis T. McMullen who provided a family of…
We construct countable Markov partitions for non-uniformly hyperbolic diffeomorphisms on compact manifolds of any dimension, extending earlier work of O. Sarig for surfaces. These partitions allow us to obtain symbolic coding on invariant…