Galois groups and prime divisors in random quadratic sequences

Abstract

Given a set S=\x2+c1,…,x2+cs\ defined over a field and an infinite sequence γ of elements of S, one can associate an arboreal representation to γ, generalizing the case of iterating a single polynomial. We study the probability that a random sequence γ produces a ``large-image'' representation, meaning that infinitely many subquotients in the natural filtration are maximal. We prove that this probability is positive for most sets S defined over Z[t], and we conjecture a similar positive-probability result for suitable sets over Q. As an application of large-image representations, we prove a density-zero result for the set of prime divisors of some associated quadratic sequences. We also consider the stronger condition of the representation being finite-index, and we classify all S possessing a particular kind of obstruction that generalizes the post-critically finite case in single-polynomial iteration.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…