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 Qp. 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 Qp. In particular, we derive some sufficient conditions for their convergence and we prove that convergent MCFs always strongly converge in Qp contrarily to the real case where strong convergence is not always guaranteed. Then, we focus on a specific algorithm that, starting from a m–tuple of numbers in Qp (p odd), 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
On p-adic multidimensional continued fractions / Murru, Nadir; Terracini, Lea. - In: MATHEMATICS OF COMPUTATION. - ISSN 1088-6842. - 88:320(2019), pp. 2913-2934. [10.1090/mcom/3450]
On p-adic multidimensional continued fractions
Murru, Nadir;
2019-01-01
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 Qp. 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 Qp. In particular, we derive some sufficient conditions for their convergence and we prove that convergent MCFs always strongly converge in Qp contrarily to the real case where strong convergence is not always guaranteed. Then, we focus on a specific algorithm that, starting from a m–tuple of numbers in Qp (p odd), 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 numbersFile | Dimensione | Formato | |
---|---|---|---|
padic-multi-cf-rev-v2.pdf
accesso aperto
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Creative commons
Dimensione
377.7 kB
Formato
Adobe PDF
|
377.7 kB | Adobe PDF | Visualizza/Apri |
S0025-5718-2019-03450-6.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
291.31 kB
Formato
Adobe PDF
|
291.31 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione