On the finiteness and periodicity of the 𝑝-adic Jacobi–Perron algorithm

Abstract

Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron to obtain periodic representations for algebraic irrationals, analogous to the case of simple continued fractions and quadratic irrationals. Continued fractions have been studied in the field of p p -adic numbers Q p \mathbb {Q}_p . MCFs have also been recently introduced in Q p \mathbb {Q}_p , including, in particular, a p p -adic Jacobi–Perron algorithm. In this paper, we address two of the main features of this algorithm, namely its finiteness and periodicity. Regarding the finiteness of the p p -adic Jacobi–Perron algorithm, our results are obtained by exploiting properties of some auxiliary integer sequences. It is known that a finite p p -adic MCF represents Q \mathbb Q -linearly dependent numbers. However, we see that the converse is not always true and we prove that in this case infinitely many partial quotients of the MCF have p p -adic valuations equal to − 1 -1 . Finally, we show that a periodic MCF of dimension m m converges to an algebraic irrational of degree less than or equal to m + 1 m+1 ; for the case m = 2 m=2 , we are able to give some more detailed results.