On p-adic multidimensional continued fractions

From MaRDI portal
Publication:5226664

DOI10.1090/MCOM/3450zbMATH Open1435.11092arXiv1805.00072OpenAlexW2963856252MaRDI QIDQ5226664FDOQ5226664


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


Publication date: 1 August 2019

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

Abstract: Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to generalize the classical continued fractions. In this paper, we propose an introductive fundamental study about MCFs in the field of the p--adic numbers mathbbQp. First, we introduce them from a formal point of view, i.e., without considering a specific algorithm that produces the partial quotients of a MCF, and we perform a general study about their convergence in mathbbQp. In particular, we derive some conditions about their convergence and we prove that convergent MCFs always strongly converge in mathbbQp contrarily to the real case where strong convergence is not ever guaranteed. Then, we focus on a specific algorithm that, starting from a m--tuple of numbers in mathbbQp, produces the partial quotients of the corresponding MCF. We see that this algorithm is derived from a generalized p--adic Euclidean algorithm and we prove that it always terminates in a finite number of steps when it processes rational numbers.


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




Recommendations




Cites Work


Cited In (15)





This page was built for publication: On \(p\)-adic multidimensional continued fractions

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