We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To send content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about sending content to .
To send content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about sending to your Kindle.
Note you can select to send to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper, we make partial progress on a function field version of the dynamical uniform boundedness conjecture for certain one-dimensional families
${\mathcal{F}}$
of polynomial maps, such as the family
$f_{c}(x)=x^{m}+c$
, where
$m\geq 2$
. We do this by making use of the dynatomic modular curves
$Y_{1}(n)$
(respectively
$Y_{0}(n)$
) which parametrize maps
$f$
in
${\mathcal{F}}$
together with a point (respectively orbit) of period
$n$
for
$f$
. The key point in our strategy is to study the set of primes
$p$
for which the reduction of
$Y_{1}(n)$
modulo
$p$
fails to be smooth or irreducible. Morton gave an algorithm to construct, for each
$n$
, a discriminant
$D_{n}$
whose list of prime factors contains all the primes of bad reduction for
$Y_{1}(n)$
. In this paper, we refine and strengthen Morton’s results. Specifically, we exhibit two criteria on a prime
$p$
dividing
$D_{n}$
: one guarantees that
$p$
is in fact a prime of bad reduction for
$Y_{1}(n)$
, yet this same criterion implies that
$Y_{0}(n)$
is geometrically irreducible. The other guarantees that the reduction of
$Y_{1}(n)$
modulo
$p$
is actually smooth. As an application of the second criterion, we extend results of Morton, Flynn, Poonen, Schaefer, and Stoll by giving new examples of good reduction of
$Y_{1}(n)$
for several primes dividing
$D_{n}$
when
$n=7,8,11$
, and
$f_{c}(x)=x^{2}+c$
. The proofs involve a blend of arithmetic and complex dynamics, reduction theory for curves, ramification theory, and the combinatorics of the Mandelbrot set.