Related papers: Arithmetic dynamics of random polynomials

We define arithmetical and dynamical degrees for dynamical systems with several rational maps on projective varieties, study their properties and relations, and prove the existence of a canonical height function associated with divisorial…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

In this paper, we study arithmetic dynamics in arbitrary characteristic, in particular in positive characteristic. We generalise some basic facts on arithmetic degree and canonical height in positive characteristic. As applications, we…

In this article, we prove the equivalence of dynamical stability, preperiodicity, and canonical height 0, for algebraic families of rational maps $f_t: \mathbb{P}^1(\mathbb{C}) \to \mathbb{P}^1(\mathbb{C})$, parameterized by $t$ in a…

We show that the dynamical degree of an (i.i.d) random sequence of dominant, rational self-maps on projective space is almost surely constant. We then apply this result to height growth and height counting problems in random orbits.

We describe the statistical properties of the dynamics of the quadratic polynomials P_a(z):=e^{2\pi a i} z+z^2 on the complex plane, with a of high return times. In particular, we show that these maps are uniquely ergodic on their measure…

Given a dominant rational self-map on a projective variety over a number field, we can define the arithmetic degree at a rational point. It is known that the arithmetic degree at any point is less than or equal to the first dynamical…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

We study arithmetic degree of a dominant rational self-map on a smooth projective variety over a function field of characteristic zero. We see that the notion of arithmetic degree and some related problems over function fields are…

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},..., a_{d-s} are fixed. Our estimate holds without restrictions on the…

We prove an analogue of the Manin-Mumford conjecture for polynomial dynamical systems over number fields. In our setting the role of torsion points is taken by the small orbit of a point $\alpha$. The small orbit of a point was introduced…

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

Let a and b be algebraic numbers such that exactly one of a and b is an algebraic integer, and let f_t(z):=z^2+t be a family of polynomials parametrized by t. We prove that the set of all algebraic numbers t for which there exist positive…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

We study algebraic dynamical systems (and, more generally, $\sigma$-varieties) $\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C}$ given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we…

In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their…

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

In this paper, we study rigidity of polynomials of arbitrary degree in the presence of neutral dynamics. Specifically, we focus on {non-renormalizable} (in the sense of Douady and Hubbard) complex polynomials of degree $d \geqslant 2$ that…