Simultaneous approximations to \(p\)-adic numbers and algebraic dependence via multidimensional continued fractions (Q2240487)

The authors continue their study of simultaneous approximation using multidimensional continued fractions, along the lines of the famous Jacobi-Perron algorithm [\textit{C.G.J. Jacobi}, Gesammelte Werke VI. Berlin: Academic Press. 385--426 (1891); \textit{O. Perron}, Math. Ann. 64, 1--76 (1907; JFM 38.0262.01)] in the context of \(p\)-adic numbers. The distance used is derived from the well-known non-Archimedean valuation on the field \(\mathbb{Q}_p\) and for sake of notational convenience they restrict themselves to the case of simultaneous approximation of two \(p\)-adic numbers. The layout of the paper is as follows: \S1. Introduction Contains a description of the multidimensional continued fraction (MCF) used for an \(n\)-tuple of real numbers and gives a historical overview of the use in number theory. \S2. Definitions and useful properties Introduces the machinery of the algorithm on \(\mathbb{Q}_p\) with \(p\) an odd prime. This includes the sequences of numerators (\(d\), here \(d=2\)), the sequence of denominators (always \(1\)), the notation using iterated matrix multiplication (generally \((d+1)\times (d+1)\) matrices, here \(2\times 2\) matrices), the \((d+1)\)-term recurrence relation (here \(4\)-term). \S3. The quality of the approximations of \(p\)-adic MCFs Results on the rate of convergence, Diophantine matters (length of recurrence, termination, effects on algebraic dependence/independence of the numbers etc.). \S4. Results related to algebraic dependence A \(p\)-adic Liouville-type theorem, consequences on linear dependence, a class of fast convergence MCF's. References (\(41\) items) As is to be expected, the study of simultaneous approximation using generalized continued fractions can be seen as entering an uncharted jungle probably harbouring unknown dangers. The authors are to be complimented on their perseverance.