Related papers: Realizing polynomial portraits

We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…

Let $f: S^2 \to S^2$ be a postcritically finite branched covering map without periodic branch points. We give necessary and sufficient algebraic conditions for $f$ to be homotopic, relative to its postcritical set, to an expanding map $g$.

We show that the set of conjugacy classes of cubic polynomials with a prefixed critical point, of preperiod $k\geq 1$, is an irreducible algebraic curve. We also establish an analogous result for quadratic rational maps. We then study a…

Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $\alpha \to \beta$ if and only if $f(\alpha)…

Given any postsingularly finite exponential function $p_\lambda(z) = \lambda \exp(z)$ where $\lambda \in \C^*$, we construct a sequence of postcritically finite unicritical polynomials $p_{d,\lambda_d}(z) = \lambda_d(1+\frac{z}{d})^d$ that…

We introduce the notion of log-Riemann surfaces. These are Riemann surfaces given by cutting and pasting planes together isometrically, and come equipped with a holomorphic local diffeomorphism to C called the projection map, and a…

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…

In this work we prove that the set of points at infinity $S_\infty:={\rm Cl}_{{\mathbb R}{\mathbb P}^m}(S)\cap\mathsf{H}_\infty$ of a semialgebraic set $S\subset{\mathbb R}^m$ which is the image of a polynomial map $f:{\mathbb…

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…

The holomorphic endomorphism f of projective space is called post-critically finite (PCF) if the forward image of the critical locus, under iteration of f, has algebraic support (i.e., is a finite union of hypersurfaces). In the case of…

An orientation-preserving branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. Inspired by classical, non-dynamical notions such as…

We study the dynamics near infinity of polynomial mappings $f$ in $\mathbb{C}^2$. We assume that $f$ has indeterminacy points and is non constant on the line at infinity $L_\infty$. If $L_\infty$ is $f$-attracting, we decompose the Green…

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

A field $k$ is called large if every irreducible $k$-curve with a $k$-rational smooth point has infinitely many $k$-points. Let $k$ be a perfect large field and let $f \in k[x]$. Consider the evaluation map $f_k: k \to k$. Assume that $f_k$…

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

In this paper, we study the critical orbit of a post-critically finite polynomial of the form $f_{c,d}(x) = x^d+c \in \mathbb{C}[x]$. We discover that in many cases the orbit elements satisfy some strong arithmetic properties. It is well…

We study rational iterated preimages of the origin under unicritical maps $f_{d,c}(x)=x^d+c$. Earlier works of Faber--Hutz--Stoll and Hutz--Hyde--Krause established finiteness and conditional bounds in the quadratic case. Building on this,…

This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…