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 save 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 saving content to .
To save 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 saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved 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.
Given a set $S=\{x^2+c_1,\dots,x^2+c_s\}$ defined over a field and an infinite sequence $\gamma$ of elements of S, one can associate an arboreal representation to $\gamma$, generalising the case of iterating a single polynomial. We study the probability that a random sequence $\gamma$ 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 $\mathbb{Z}[t]$, and we conjecture a similar positive-probability result for suitable sets over $\mathbb{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 generalises the post-critically finite case in single-polynomial iteration.