Search arXivSearch

arXiv · 1805.05632

Some problems of arithmetic origin in rational dynamics

Abstract

These are lecture notes from a course in arithmetic dynamics given in Grenoble in June 2017. The main purpose of this text is to explain how arithmetic equidistribution theory can be used in the dynamics of rational maps on P^1. We first briefly introduce the basics of the iteration theory of rational maps on the projective line over C, as well as some elements of iteration theory over an arbitrary complete valued field and the construction of dynamically defined height functions for rational functions defined over \overline Q. The equidistribution of small points gives some original information on the distribution of preperiodic orbits, leading to some non-trivial rigidity statements. We then explain some consequences of arithmetic equidistribution to the study of the geometry of parameter spaces of such dynamical systems, notably pertaining to the distribution of special parameters and the classification of special subvarieties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Romain Dujardin. 2020-05-12. Some problems of arithmetic origin in rational dynamics. https://arxiv.org/abs/1805.05632

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS