Preperiodic points and unlikely intersections

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 complex numbers c for which both a and b are preperiodic for z^d+c is infinite if and only if a^d = b^d. This provides an affirmative answer to a question of Zannier, which itself arose from questions of Masser concerning simultaneous torsion sections on families of elliptic curves. Using similar techniques, we prove that if two complex rational functions f and g have infinitely many preperiodic points in common, then they must have the same Julia set. This generalizes a theorem of Mimar, who established the same result assuming that f and g are defined over an algebraic extension of the rationals. The main arithmetic ingredient in the proofs is an adelic equidistribution theorem for preperiodic points over number fields and function fields, with non-archimedean Berkovich spaces playing an essential role.Comment: 26 pages. v3: Final version to appear in Duke Math.

Riemann-Roch and Abel-Jacobi theory on a finite graph

It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate and prove a graph-theoretic analogue of the classical Riemann-Roch theorem. We also prove several results, analogous to classical facts about Riemann surfaces, concerning the Abel-Jacobi map from a graph to its Jacobian. As an application of our results, we characterize the existence or non-existence of a winning strategy for a certain chip-firing game played on the vertices of a graph.Comment: 35 pages. v3: Several minor changes made, mostly fixing typographical errors. This is the final version, to appear in Adv. Mat