For a morphism $f:¶^N \to ¶^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.
Determination of all rational preperiodic points for morphisms of PN
Published 2012 in Mathematics of Computation
ABSTRACT
PUBLICATION RECORD
- Publication year
2012
- Venue
Mathematics of Computation
- Publication date
2012-10-23
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-35 of 35 references · Page 1 of 1
CITED BY
Showing 1-27 of 27 citing papers · Page 1 of 1