Related papers: On postcritically finite polynomials, part 1: crit…

A holomorphic endomorphism of $\mathbb{CP}^n$ is post-critically algebraic if its critical hypersurfaces are periodic or preperiodic. This notion generalizes the notion of post-critically finite rational maps in dimension one. We will study…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

We show that for any integer n and any field k of characteristic different from 2 there are at most finitely many isomorphism classes of quadratic morphisms from the projective line over k to itself with a finite postcritical orbit of size…

We give the classification, up to homeomorphisms, of reduced complex polynomials with 2 variables with one critical value.

We study the postcritically-finite (PCF) maps in the moduli space of complex polynomials $\mathrm{MP}_d$. For a certain class of rational curves $C$ in $\mathrm{MP}_d$, we characterize the condition that $C$ contains infinitely many PCF…

The control of postcritical sets of quadratic polynomials with a neutral fixed point is a main ingredient in the remarkable work of Buff and Ch\'eritat to construct quadratic Julia sets with positive area. Based on the Inou-Shishikura…

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to…

We characterize all linear operators on finite or infinite-dimensional spaces of univariate real polynomials preserving the sets of elliptic, positive, and non-negative polynomials, respectively. This is done by means of Fischer-Fock…

In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…

Let $f$ be a polynomial over a global field $K$. For each $\alpha$ in $K$ and $N$ in $\mathbb{Z}_{\geq 0}$ denote by $K_N(f,\alpha)$ the arboreal field $K(f^{-N}(\alpha))$ and by $D_N(f,\alpha)$ its degree over $K$. It is conjectured that…

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

In the moduli space of degree d polynomials, we prove the equidistribution of postcritically finite polynomials toward the bifurcation measure. More precisely, using complex analytic arguments and pluripotential theory, we prove the…

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

We provide an explicit construction of the arboreal Galois group for the postcritically finite polynomial $f(z) = z^2 +c$, where $c$ belongs to some arbitrary field of characteristic not equal to $2$. In this first of two papers, we…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…