相关论文: Unmating of expanding Thurston maps with Julia set…

After giving an introduction to the procedure dubbed slow polynomial mating and stating a conjecture relating this to other notions of polynomial mating, we show conformally correct pictures of the slow mating of two degree 3 post…

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…

The purpose of this paper is to initiate a theory concerning the dynamics of asymptotically holomorphic polynomial-like maps. Our maps arise naturally as deep renormalizations of asymptotically holomorphic extensions of $C^r$ ($r>3$)…

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

The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations…

In this article, we show that all admissible rational maps with fixed or period two cluster cycles can be constructed by the mating of polynomials. We also investigate the polynomials which make up the matings that construct these rational…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

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…

A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…

We consider some two-dimensional birational transformations. One of them is a birational deformation of the H\'enon map. For some of these birational mappings, the post critical set (i.e. the iterates of the critical set) is infinite and we…

Expanding Thurston maps were introduced by M. Bonk and D. Meyer with motivation from complex dynamics and Cannon's conjecture from geometric group theory via Sullivan's dictionary. In this paper, we show that the entropy map of an expanding…

Associated to a Thurston map $f: S^2 \to S^2$ with postcritical set $P$ are several different invariants obtained via pullback: a relation on the set of free homotopy classes of curves in $S^2- P$, a linear operator on the free $\R$-module…

Any finite union of disjoint, mutually exterior Jordan curves in the complex plane can be approximated arbitrarily well in the Hausdorff topology by polynomial Julia sets. Furthermore, the proof is constructive.

In this paper we prove that the monotonicity of kneading sequences and topological entropy, a fundamental structural property of the quadratic family, extends to the class of power-law unimodal maps $f_a(x)=a-|x|^r$ for arbitrary critical…

Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient…

In this paper we present an algorithm to obtain the parameter planes of families of root-finding methods with several free critical points. The parameter planes show the joint behaviour of all critical points. This algorithm avoids the…

In the Weighted Triangle-Free 2-Matching problem (WTF2M), we are given an undirected edge-weighted graph. Our goal is to compute a maximum-weight subgraph that is a 2-matching (i.e., no node has degree more than $2$) and triangle-free…

Let $H^d$ be the set of all rational maps of degree $d\ge 2$ on the Riemann sphere which are expanding on Julia set. We prove that if $f\in H^d$ and all or all but one critical points (or values) are in the immediate basin of attraction to…