On p-adic multidimensional continued fractions

DOI10.1090/MCOM/3450MaRDI QIDQ5226664zbMATH OpenOpenAlexFDO

Publication date 1 August 2019

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

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

continued fractions \(p\)-adic numbers multidimensional continued fractions Jacobi-Perron algorithm

Approximation in non-Archimedean valuations (11J61) Continued fractions and generalizations (11J70) Non-Archimedean valued fields (12J25)

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

m a t h b b Q_{p}

. 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

m a t h b b Q_{p}

. In particular, we derive some conditions about their convergence and we prove that convergent MCFs always strongly converge in

m a t h b b Q_{p}

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

m a t h b b Q_{p}

, 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.

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)