On the finiteness and periodicity of the p-adic Jacobi-Perron algorithm

From MaRDI portal
Publication:5118857

DOI10.1090/MCOM/3540zbMATH Open1455.11099arXiv1901.04922OpenAlexW3009986481MaRDI QIDQ5118857FDOQ5118857


Authors: Nadir Murru, L. Terracini Edit this on Wikidata


Publication date: 27 August 2020

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to obtain periodic representations for algebraic irrationals, as it is for continued fractions and quadratic irrationals. Since continued fractions have been also studied in the field of p--adic numbers mathbbQp, also MCFs have been recently introduced in mathbbQp together to a p--adic Jacobi--Perron algorithm. In this paper, we address th study of two main features of this algorithm, i.e., finiteness and periodicity. In particular, regarding the finiteness of the p--adic Jacobi--Perron algorithm our results are obtained by exploiting properties of some auxiliary integer sequences. Moreover, it is known that a finite p--adic MCF represents mathbbQ--linearly dependent numbers. We see that the viceversa is not always true and we prove that in this case infinite partial quotients of the MCF have p--adic valuations equal to 1. Finally, we show that a periodic MCF of dimension m converges to algebraic irrationals of degree less or equal than m+1 and for the case m=2 we are able to give some more detailed results.


Full work available at URL: https://arxiv.org/abs/1901.04922




Recommendations




Cites Work


Cited In (9)





This page was built for publication: On the finiteness and periodicity of the \(p\)-adic Jacobi-Perron algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118857)