English

Dynamically distinguishing polynomials

Dynamical Systems 2017-07-27 v3 Number Theory

Abstract

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime pp, reduce its coefficients mod pp and consider its action on the field Fp\mathbb{F}_p. We say a subset of Z[x]\mathbb{Z}[x] is dynamically distinguishable mod pp if the associated mod pp dynamical systems are pairwise non-isomorphic. For any k,MZ>1k,M\in\mathbb{Z}_{>1}, we prove that there are infinitely many sets of integers M\mathcal{M} of size MM such that {xk+mmM}\left\{ x^k+m\mid m\in\mathcal{M}\right\} is dynamically distinguishable mod pp for most pp (in the sense of natural density). Our proof uses the Galois theory of dynatomic polynomials largely developed by Morton, who proved that the Galois groups of these polynomials are often isomorphic to a particular family of wreath products. In the course of proving our result, we generalize Morton's work and compute statistics of these wreath products.

Keywords

Cite

@article{arxiv.1609.09186,
  title  = {Dynamically distinguishing polynomials},
  author = {Andrew Bridy and Derek Garton},
  journal= {arXiv preprint arXiv:1609.09186},
  year   = {2017}
}

Comments

18 pages, updated bibliography, updated acknowledgements, and modified notation

R2 v1 2026-06-22T16:04:54.063Z