# Simultaneous approximations to p-adic numbers and algebraic dependence via multidimensional continued fractions

## TL;DR

This paper explores the use of multidimensional continued fractions in the $p$-adic setting to improve simultaneous approximations of algebraically dependent $p$-adic numbers, extending classical methods.

## Contribution

It introduces and analyzes the application of multidimensional continued fractions to $p$-adic numbers, providing new insights into approximation quality and algebraic dependence.

## Key findings

- Analyzes the approximation quality of $p$-adic MCFs for two $p$-adic numbers.
- Provides conditions for algebraic dependence to be preserved in approximations.
- Establishes criteria for the finiteness of the $p$-adic Jacobi--Perron algorithm.

## Abstract

Unlike the real case, there are not many studies and general techniques for providing simultaneous approximations in the field of $p$--adic numbers $\mathbb Q_p$. Here, we study the use of multidimensional continued fractions (MCFs) in this context. MCFs were introduced in $\mathbb R$ by Jacobi and Perron as a generalization of continued fractions and they have been recently defined also in $\mathbb Q_p$. We focus on the dimension two and study the quality of the simultaneous approximation to two $p$-adic numbers provided by $p$-adic MCFs, where $p$ is an odd prime. Moreover, given algebraically dependent $p$--adic numbers, we see when infinitely many simultaneous approximations satisfy the same algebraic relation. This also allows to give a condition that ensures the finiteness of the $p$--adic Jacobi--Perron algorithm when it processes some kinds of $\mathbb Q$--linearly dependent inputs.