Markov processes and some PCF quadratic polynomials

From MaRDI portal



Abstract: For any ngeq1, let Tn be the complete binary rooted tree of height n, and f(x)=(x+a)2−a−1 such that aeqpmb2 for any binmathbbZ. In cite{Settled}, Jones and Boston empirically observed that iteratively applying a certain Markov process on the factorization types of f gives rise to certain permutation groups Mn(f)leqextAut(Tn) for nleq5. We prove a refined version of this phenomenon for all n, and for all the irreducible post-critically finite quadratic polynomials with integer coefficients, except for certain conjugates of x2−2. We do this by constructing these groups explicitly. Although there have already been some conjectures relating the Markov processes to the dynamics of quadratic polynomials, our results are the first to prove such a connection. If f(x)inmathbbZ[x] is a post-critically finite quadratic polynomial, and Gn(f) is the Galois group of fn over mathbbQ(i), then we conjecture that for all ngeq1, Mn(f) contains a subgroup isomorphic to Gn(f), analogous to the role of Mumford-Tate groups in the classical arithmetic geometry. We provide evidence that this is implied by a purely group theoretical statement.












This page was built for publication: Markov processes and some PCF quadratic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320014)