On a continued fraction algorithm in finite extensions of p and its metrical theory
Abstract
We develop a continued fraction algorithm in finite extensions of p generalising certain algorithms in p, and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the associated continued fraction maps for our algorithms using subsequence ergodic theory and moving averages.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.