Related papers: Bicritical rational maps with a common iterate

A Belyi map $\beta: \mathbb{P}^1(\mathbb{C}) \to \mathbb{P}^1(\mathbb{C})$ is a rational function with at most three critical values; we may assume these values are $\{ 0, \, 1, \, \infty \}$. Replacing $\mathbb{P}^1$ with an elliptic curve…

We prove that if $F$ is a degree $3$ Thurston map with two fixed critical points, then any irreducible obstruction for $F$ contains a Levy cycle. As a corollary, it will be shown that if $f$ and $g$ are two postcritically finite cubic…

In this article, we combine complex-analytic and arithmetic tools to study the preperiodic points of one-dimensional complex dynamical systems. We show that for any fixed complex numbers a and b, and any integer d at least 2, the set of…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. Recently, Blake and Lin computed the number of shortest…

Since the end of the XIXth century, we know that each birational map of the complex projective plane is the product of a finite number of quadratic birational maps of the projective plane; this motivates our work which essentially deals…

The dominant rational maps of finite degree from a fixed variety to varieties of general type, up to birational isomorphisms, form a finite set. This has been known as the Iitaka-Severi conjecture, and is nowdays an established result, in…

Let $G$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A $k$-matching of a graph $G$ is a function $f:E(G)\rightarrow \{0,1,\ldots, k\}$ satisfying $\sum_{e \in E_G(v)} f(e) \leq k$ for every vertex $v \in V(G)$,…

In this paper we use motivic integration and non-archimedean analytic geometry to study the singularities at infinity of the fibers of a polynomial map $f\colon \mathbb A^d_\mathbb C \to \mathbb A^1_\mathbb C$. We show that the motive…

Let $K$ be a field, and let $f\in K(z)$ be a rational function of degree $d\geq 2$. The Galois group of the field extension generated by the preimages of $x_0\in K$ under all iterates of $f$ naturally embeds in the automorphism group of an…

As a particular problem within the field of non-autonomous discrete systems, we consider iterations of two quadratic maps $f_{c_0}=z^2+c_0$ and $f_{c_1}=z^2+c_1$, according to a prescribed binary sequence, which we call a \emph{template}.…

Let f : X --> X be a dominant rational map of a projective variety defined over a number field. An important geometric-dynamical invariant of f is its (first) dynamical degree d_f= lim SpecRadius((f^n)^*)^{1/n}. For algebraic points P of X…

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$, extending earlier work by the author and Criel Merino. In particular, we show that the critical group of such…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…

We study the scaling behavior of period doublings in two unidirectionally-coupled one-dimensional maps near a bicritical point where two critical lines of period-doubling transition to chaos in both subsystems meet. Note that the bicritical…

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

We consider the indeterminacy locus $I(\Phi_n)$ of the iterate map $\Phi_n:\overline{M}_d-rightarrow\overline{M}_{d^n}$, where $\overline{M}_d$ is the GIT compactification of the moduli space $M_d$ of degree $d$ complex rational maps. We…

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…