Related papers: Constructing rational maps with cluster points usi…
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…
The iteration of rational maps is well-understood in dimension 1 but less so in higher dimensions. We study some maps on spaces of matrices which present a weak complexity with respect to the ring structure. First we give some properties of…
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
Criteria for piecewise linear circle homeomorphisms to be conjugate to a rigid rotation, $x\to x+\omega~({\rm mod}~1)$, with rational rotation number $\omega$ are given. The consequences of the existence of such maps in families of maps is…
The phenomenology of a system of two coupled quadratic maps is studied both analytically and numerically. Conditions for synchronization are given and the bifurcations of periodic orbits from this regime are identified. In addition, we show…
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
A rational map between certain specific threefolds is given in an explicit manner.
Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…
The onset and bifurcation points of the $n$-cycles of a polynomial map are located through a characteristic equation connecting cyclic polynomials formed by periodic orbit points. The minimal polynomials of the critical parameters of the…
In this paper, we construct geometrically finite rational maps with buried critical points on the boundaries of some hyperbolic components by using the pinching and plumbing deformations.
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to…
For a finite dimensional vector space equipped with a $\mathbb C$-algebra structure, one can define rational maps using the algebraic structure. In this paper, we describe the growth of the degree sequences for this type of rational maps.
If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…
Given two ellipses, one surrounding the other one, Poncelet introduced a map $P$ from the exterior one to itself by using the tangent lines to the interior ellipse. This procedure can be extended to any two smooth, nested and convex ovals…
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
Rational loops played a central role in Uhlenbeck's construction of harmonic maps into U(n) (chiral model in physics), and they are generated by simple elements with one pole and one zero constructed from Hermitian projections. It has been…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…