LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Dynamical modular curves for quadratic polynomial maps

Photo from academic.microsoft.com

Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues… Click to show full abstract

Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The preperiodic points for a quadratic polynomial map may be endowed with the structure of a directed graph satisfying certain strict conditions; we call such a graph admissible. Given an admissible graph $G$, we construct a curve $X_1(G)$ whose points parametrize quadratic polynomial maps -- which, up to equivalence, form a one-parameter family -- together with a collection of marked preperiodic points that form a graph isomorphic to $G$. Building on work of Bousch and Morton, we show that these curves are irreducible in characteristic zero, and we give an application of irreducibility in the setting of number fields. We end with a discussion of the Galois theory associated to the preperiodic points of quadratic polynomials, including a certain Galois representation that arises naturally in this setting.

Keywords: polynomial maps; curves quadratic; preperiodic points; dynamical modular; quadratic polynomial; modular curves

Journal Title: Transactions of the American Mathematical Society
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.