Related papers: Thurston's algorithm and rational maps from quadra…

In this paper, we study CTP maps, that is, marked rational maps with constant Thurston pullback mapping. We prove that all the regular or mixing CTP polynomials satisfy McMullen's condition. Additionally, we construct a new class of…

Thurston maps are branched self-coverings of the sphere whose critical points have finite forward orbits. We give combinatorial and algebraic characterizations of Thurston maps that are isotopic to expanding maps as "Levy-free" maps and as…

We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…

In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…

We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…

Expanding Thurston maps form a class of branched covering maps on the topological $2$-sphere $S^{2}$, which are topological models of some non-uniformly expanding rational maps without any smoothness or holomorphicity assumption initially…

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

Let $\tilde f\colon(S^2,\tilde A)\to(S^2,\tilde A)$ be a Thurston map and let $M(\tilde f)$ be its mapping class biset: isotopy classes rel $\tilde A$ of maps obtained by pre- and post-composing $\tilde f$ by the mapping class group of…

Under some mild assumptions, an orientation-preserving branched covering map of marked $2$-spheres induces a pullback map between the corresponding Teichm\"uller spaces. By analyzing the associated pushforward operator acting on integrable…

An orientation-preserving branched covering map $f\colon S^2 \to S^2$ is called a critically fixed Thurston map if $f$ fixes each of its critical points. It was recently shown that there is an explicit one-to-one correspondence between…

We investigate the family of marked Thurston maps that are defined everywhere on the topological sphere $S^2$, potentially excluding at most countable closed set of essential singularities. We show that when an unmarked Thurston map $f$ is…

The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…

We consider rational maps $f$ on the Riemann sphere $\widehat {\mathbb{C}}$ with an $f$-invariant set $P\subset \widehat {\mathbb{C}}$ of four marked points containing the postcritical set of $f$. We show that the dynamics of the…

A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…

We consider Thurston maps, i.e., branched covering maps $f\colon S^2\to S^2$ that are postcritically finite. In addition, we assume that $f$ is expanding in a suitable sense. It is shown that each sufficiently high iterate $F=f^n$ of $f$ is…

We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…

Mapping is an essential task for mobile robots and topological representation often works as a basis for the various applications. In this paper, a novel framework that can build topological maps incrementally is proposed. The algorithm is…

In this paper, we prove that a postcritically finite rational map with non-empty Fatou set is Thurstion equivalent to an expanding Thurston map if and only if its Julia set is homeomorphic to the standard Sierpinski carpet

Suppose $f$ and $g$ are two post-critically finite polynomials of degree $d_1$ and $d_2$ respectively and suppose both of them have a finite super-attracting fixed point of degree $d_0$. We prove that one can always construct a rational map…