arXiv:1210.6246 [math.NT]AbstractReferencesReviewsResources
Determination of all rational preperiodic points for morphisms of PN
Published 2012-10-23, updated 2013-07-03Version 3
For a morphism $f:\P^N \to \P^N$, the points whose forward orbit by $f$ is finite are called preperiodic points for $f$. This article presents an algorithm to effectively determine all the rational preperiodic points for $f$ defined over a given number field $K$. This algorithm is implemented in the open-source software Sage for $\Q$. 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.
Comments: 18 pages. To appear in Mathematics of Computation. Sage implementation of the algorithm is Sage Trac Ticket #14219
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2408.13262 [math.NT] (Published 2024-08-08)
Some families of polynomials satisfying uniform boundedness for rational preperiodic points
arXiv:math/9512217 [math.NT] (Published 1995-12-11)
The Complete Classification of Rational Preperiodic Points of Quadratic Polynomials over Q: A Refined Conjecture
arXiv:2010.09910 [math.NT] (Published 2020-10-19)
Families of polynomials of every degree with no rational preperiodic points