math.NT — Number Theory
On several conjectures concerning p-adic continued fractions
Let be an odd prime and let be even. If , infinitely many real and infinitely many imaginary quadratic fields have the form , where is an integer whose -adic square roots have least period under Browkin's second algorithm. For , we give two radicands and bound all such radicands in terms of their preperiods. We prove eventual periodicity for quadratic inputs to the fourth algorithm of Wang and Deng at and to Yasutomi's simultaneous algorithm for real quadratic fields at . The real approximation error after digits is for Ruban's expansion of a quadratic irrational and for Schneider's expansion of a quadratic -adic unit. For both Browkin algorithms and the alternating algorithm of Murru and Romeo, we determine the real and -adic approximation exponents in terms of the reduced denominator for Haar-almost every input. The real limit is transcendental and has finite irrationality exponent. In each cubic field embedded in , a suitable generator gives eventual periodicity for every basis in a variant of the algorithm of Saito, Tamura and Yasutomi that computes the translation after inversion and row reduction. Computing the translation from the input gives nonperiodic expansions on a dense set of bases in every degree at least two. For the -adic Jacobi–Perron algorithm we construct pairs of Liouville numbers on a rational line with infinite expansions that are not eventually periodic. We also prove an irreducibility conjecture for a sequence of polynomials arising from a Pell equation.