# Dynamically distinguishing polynomials

@article{Bridy2016DynamicallyDP,
title={Dynamically distinguishing polynomials},
author={Andrew Bridy and Derek Garton},
journal={Research in the Mathematical Sciences},
year={2016},
volume={4},
pages={1-17}
}
• Published 29 September 2016
• Mathematics
• Research in the Mathematical Sciences
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field $${\mathbb {F}}_p$$Fp. We say a subset of $${\mathbb {Z}}[x]$$Z[x] is dynamically distinguishable mod p if the associated mod p dynamical systems are pairwise non-isomorphic. For any $$k,M\in {\mathbb {Z}}_{>1}$$k,M∈Z>1, we prove that there are infinitely many sets of integers $${\mathcal {M}}$$M of size M…
6 Citations

### The Cycle Structure of Unicritical Polynomials

• Mathematics
International Mathematics Research Notices
• 2018

### On certain algebraic curves related to polynomial maps

An algebraic/arithmetical proof of irreducibility over the algebraic closure of Q is given for the polynomial -03A6n, (x, c) whose roots are the periodic points of least period n of the dynamical

### Corrigendum: ‘On certain algebraic curves related to polynomial maps, Compositio Math. 103 (1996), 319–350’

• P. Morton
• Mathematics
Compositio Mathematica
• 2010
Abstract An argument is given to fill a gap in a proof in the author’s article On certain algebraic curves related to polynomial maps, Compositio Math. 103 (1996), 319–350, that the polynomial

### Functional graphs of polynomials over finite fields

• Mathematics, Computer Science
J. Comb. Theory, Ser. B
• 2016

### A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields

• Mathematics, Computer Science
• 2016
It is proved that for sets of edges in a functional graph, the quality of being a cycle and thequality of being interpolable are "uncorrelated enough" to imply that the average number of components of the functional graphs of polynomials of fixed degree over a finite field is within a bounded constant of Kruskal's bound.

### Galois theory of periodic orbits of rational maps

• Mathematics
• 1992
The periodic points of a rational mapping are roots of a polynomial. If the coefficients of the mapping are algebraic numbers, then the periodic orbits are also algebraic numbers. A sequence of

### The Arithmetic of Dynamical Systems

* Provides an entry for graduate students into an active field of research * Each chapter includes exercises, examples, and figures * Will become a standard reference for researchers in the field

### Periods of Iterated Rational Functions over a Finite Field

• Mathematics
• 2015
If f is a polynomial of degree d in 𝔽q[x], let ck(f) be the number of cycles of length k in the directed graph on 𝔽q with edges {(v,f(v))}v∈𝔽q. For random polynomials, the numbers ck, 1 ≤ k ≤ b,

### MODULI SPACES OF QUADRATIC RATIONAL MAPS WITH A MARKED PERIODIC POINT OF SMALL ORDER

• Mathematics
• 2015
The surface corresponding to the moduli space of quadratic endomorphisms of P1 with a marked periodic point of order n is studied. It is shown that the surface is rational over Q when n 5 and is of

### The Space of Morphisms on Projective Space

The theory of moduli of morphisms on P^n generalizes the study of rational maps on P^1. This paper proves three results about the space of morphisms on P^n of degree d > 1, and its quotient by the