Article contents
A census of quadratic post-critically finite rational functions defined over
$\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\mathbb{Q}$
Published online by Cambridge University Press: 01 July 2014
Abstract
We find all quadratic post-critically finite (PCF) rational functions defined over $\mathbb{Q}$, up to conjugation by elements of
$\mathop{\rm PGL}_2(\overline{\mathbb{Q}})$. We describe an algorithm to search for possibly PCF functions. Using the algorithm, we eliminate all but 12 rational functions, all of which are verified to be PCF. We also give a complete description of all possible rational preperiodic structures for quadratic PCF functions defined over
$\mathbb{Q}$.
- Type
- Research Article
- Information
- LMS Journal of Computation and Mathematics , Volume 17 , Special Issue A: Algorithmic Number Theory Symposium XI , 2014 , pp. 314 - 329
- Copyright
- © The Author(s) 2014
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151019020607114-0538:S1461157014000266_inline5.gif?pub-status=live)
- 10
- Cited by