Determination of all rational preperiodic points for morphisms of PN
Number Theory
2013-07-04 v3
Abstract
For a morphism , the points whose forward orbit by is finite are called preperiodic points for . This article presents an algorithm to effectively determine all the rational preperiodic points for defined over a given number field . This algorithm is implemented in the open-source software Sage for . Additionally, the notion of a dynatomic zero-cycle is generalized to preperiodic points. Along with examining their basic properties, these generalized dynatomic cycles are shown to be effective.
Keywords
Cite
@article{arxiv.1210.6246,
title = {Determination of all rational preperiodic points for morphisms of PN},
author = {Benjamin Hutz},
journal= {arXiv preprint arXiv:1210.6246},
year = {2013}
}
Comments
18 pages. To appear in Mathematics of Computation. Sage implementation of the algorithm is Sage Trac Ticket #14219