Related papers: On postcritically finite polynomials, part 1: crit…
This continues the investigation of a combinatorial model for the variation of dynamics in the family of rational maps of degree two, by concentrating on those varieties in which one critical point is periodic. We prove some general results…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
Andrews and Petsche proposed in 2020 a conjectural characterization of all pairs $(f,\alpha)$, where $f$ is a polynomial over a number field $K$ and $\alpha\in K$, such that the dynamical Galois group of the pair $(f,\alpha)$ is abelian. In…
A rational function of degree at least two with coefficients in an algebraically closed field is post-critically finite (PCF) if all of its critical points have finite forward orbit under iteration. We show that the collection of PCF…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…
Holomorphic renormalization plays an important role in complex polynomial dynamics. We consider certain conditions guaranteeing that a polynomial which does not admit a polynomial-like connected Julia set still admits an invariant continuum…
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, g)$ be a pair of complex analytic functions on a singular analytic space $X$. We give ``the correct'' definition of the relative polar curve of $(f, g)$, and we give a very formal generalization of L\^e's attaching result, which…
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u_1 o u_2 o ... o u_r. His main achievement was a procedure for obtaining any decomposition of f from any other by…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…
We study the dynamics of a class of endomorphisms of A^N which restricts, when N = 1, to the class of unicritical polynomials. Over the complex numbers, we obtain lower bounds on the sum of Lyapunov exponents, and a statement which…
Recently the first author studied the bifurcation of critical points of families of functionals on a Hilbert space, which are parametrised by a compact and orientable manifold having a non-vanishing first integral cohomology group. We…