betaFeedback

WorksMathematics

On several conjectures concerning p-adic continued fractions

Abstract

Let pp be an odd prime and let h≥2h\ge2 be even. If (p,h)≠(3,2)(p,h)\ne(3,2), infinitely many real and infinitely many imaginary quadratic fields have the form Q(D)\mathbb Q(\sqrt D), where DD is an integer whose pp-adic square roots have least period hh under Browkin's second algorithm. For (p,h)=(3,2)(p,h)=(3,2), 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 p=5p=5 and to Yasutomi's simultaneous algorithm for real quadratic fields at p=3p=3. The real approximation error after nn digits is O(n−3)O(n^{-3}) for Ruban's expansion of a quadratic irrational and for Schneider's expansion of a quadratic pp-adic unit. For both Browkin algorithms and the alternating algorithm of Murru and Romeo, we determine the real and pp-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 Qp\mathbb Q_p, a suitable generator gives eventual periodicity for every basis 1,x,y1,x,y 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 pp-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.

Use of artificial intelligence. The research was carried out under human direction from the choice of topic and research questions to the selection of results for the paper. OpenAI’s ChatGPT 6 and Anthropic’s Claude Opus 5.5 assisted in developing arguments, checking examples and drafting the manuscript. OpenAI’s ChatGPT 6.2 Astra developed further constructions and proofs, checked the computations and references, and revised the manuscript. Anthropic’s Claude subsequently reviewed the full manuscript and suggested improvements to the proofs and exposition. The human review did not include an independent check of every proof.

Introduction

Several continued fraction algorithms expand quadratic irrationals in Qp\mathbb{Q}_p. The choice of partial quotients affects periodicity and the behavior of the rational convergents in R\mathbb{R}. Romeo surveys these algorithms and their history [24].

Section 3 concerns Browkin’s second algorithm. Murru, Romeo and Santilli [15 Conjecture 20] ask whether, for every odd prime pp and every positive even integer hh, infinitely many nonsquare integers have a square root with least period hh. Theorems 3.1 and 3.17 give infinitely many distinct real quadratic fields and infinitely many distinct imaginary quadratic fields for every pair except (3,2)(3,2). Browkin [4 Lemma 2] had constructed examples of period two for p≥5p \ge5. The period-four construction of Murru, Romeo and Santilli [15 Theorem 18 and Corollary 19] works for p≥5p \ge5. At p=3p=3 the odd-step correction changes their word. Proposition 3.8 gives a family valid at every odd prime. Our

2020 Mathematics Subject Classification. Primary 11J70, Secondary 11B39, 11J61, 11K50, 11R11.

Key words and phrases. pp-adic continued fractions, quadratic irrationals, periodicity, real convergence, Jacobi–Perron algorithm.

Tomislav Pejković proposed the topic and guided the research presented in this paper. Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia ([email protected]). construction adapts the palindromes of Capuano, Murru and Terracini [6] to Browkin’s correction at the odd steps. At p=3p = 3 the square roots of 171 and 13851 have period two, with least preperiods 10 and 40. A bound for the radicand in terms of the preperiod restricts any further examples. Infinitude in this case remains open.

Section 4 treats periodicity for quadratic inputs. Wang and Deng use the half-trace of each complete quotient to choose its partial quotient. Yasutomi uses a chosen real embedding in his simultaneous algorithm. For the fourth algorithm of Wang and Deng the complete quotients of every quadratic irrational are eventually periodic at p=5p = 5. We determine the sharp eventual bound on their denominators and give sufficient conditions for periodicity of the fifth algorithm. For Yasutomi’s simultaneous algorithm we prove periodicity at p=3p = 3 and show that the real convergents tend to the image of the input under the chosen embedding. For each p≥5p \ge5, inputs of period two in every admissible real quadratic field can converge to the other real conjugate. For Yasutomi’s separate algorithm with a choice of sign we describe periodic orbits and the accuracy of their convergents.

Capuano, Veneziano and Zannier [7 Proposition 4.5] proved real convergence for every quadratic Ruban expansion. In Section 5 we bound the error after nn digits by O(n−3)O(n^{-3}). Corollary 5.3 gives the same bound for Schneider’s expansions of quadratic pp-adic units, improving the exponent in [22 Theorem 2.3]. Section 6 treats Browkin’s two algorithms and the alternating algorithm of Murru and Romeo [14]. For these algorithms, convergence to a real conjugate at a rate faster than every inverse power, even along a subsequence, forces eventual periodicity. Romeo asks whether convergence to a real conjugate alone forces eventual periodicity [25 Conjectures 2 and 17]. Section 7 treats the same three algorithms with respect to additive Haar measure on Qp\mathbb{Q}_p. For almost every input the real limit is transcendental with finite irrationality exponent. Theorem 7.1 gives the exponential rate of convergence, and Corollary 7.5 gives the real and pp-adic exponents in terms of the reduced denominator.

In dimension two, Section 8 studies a version of the algorithm of Saito, Tamura and Yasutomi in which the rational constants are reduced after inversion and row reduction. We prove periodicity for all cubic bases in the stated domain. For the translation evaluated on the input in formula (4) of the arXiv version of [27], Corollary 8.3 gives, in every degree at least two, a dense set of bases whose expansions are not eventually periodic. The same bases reach the fixed power basis in one step when the constants are reduced after inversion. Section 9 constructs pairs of Liouville numbers on a rational line with infinite, nonperiodic pp-adic Jacobi–Perron expansions, answering a question of Murru and Terracini [17 Conjecture 1]. In Section 10, Theorem 10.1 proves an irreducibility conjecture of Capuano, Mula, Terracini and Veneziano [5 Conjecture 4.29]. We also relate their prime-value conjecture to two classical sequences and bound the common divisors of terms at a fixed distance.

Preliminaries

Unless otherwise stated, pp is an odd prime. We write υp\upsilon_p for the valuation normalized by υp(p)=1\upsilon_p(p) = 1, put υp(0)=+∞\upsilon_p(0) = +\infty, and write ∣x∣p=p−υp(x)|x|_p = p^{-\upsilon_p(x)}. An absolute value without a subscript is the usual real or complex absolute value, and x′x' denotes the other conjugate of a quadratic irrational xx. The sign of a nonzero rational number refers to its real sign. The prime-to-pp part of ±pkm∈Z[1/p]∖{0}\pm p^k m \in\mathbb{Z}[1/p] \setminus\{0\}, where m>0m > 0 and p∤mp \nmid m, is mm.

Put Σp={−(p−1)/2,…,(p−1)/2}\Sigma_p = \{-(p - 1)/2,\ldots,(p - 1)/2\}. Browkin’s balanced truncations [3, 4] are the unique representatives satisfying

s(x)∈Z[1/p]∩(−p/2,p/2),x−s(x)∈pZp,(1)s(x) \in\mathbb{Z}[1/p] \cap(-p/2,p/2), \qquad x - s(x) \in p\mathbb{Z}_p, \tag*{(1)}
t(x)∈Z[1/p]∩(−1/2,1/2),x−t(x)∈Zp.(2)t(x) \in\mathbb{Z}[1/p] \cap(-1/2,1/2), \qquad x - t(x) \in\mathbb{Z}_p. \tag*{(2)}

For a pp-adic unit, s(x)s(x) is the nonzero element of Σp\Sigma_p congruent to xx modulo pp.

In the one-dimensional algorithms with partial numerators equal to one, the complete quotients αn\alpha_n and partial quotients ana_n satisfy

αn+1=1αn−an.(3)\alpha_{n+1} = \frac{1}{\alpha_n-a_n}. \tag*{(3)}

We write [a0;a1,a2,…][a_0; a_1, a_2, \ldots] for the expansion and use an overline for a repeated word. Period length always means minimal eventual period. The minimal preperiod is the least index at which a periodic tail begins. For a parity-dependent algorithm, complete quotients are compared only at indices of the same parity.

Put M(a)=(a110)M(a)=\begin{pmatrix}a&1\\1&0\end{pmatrix}. Matrices act by Möbius transformations, so

[a0;a1,…,am,z]=M(a0)⋯M(am)⋅z.[a_0; a_1,\ldots,a_m,z]=M(a_0)\cdots M(a_m)\cdot z.

Finite words are interpreted projectively by these products. We use continuants K()=1K()=1, K(a1)=a1K(a_1)=a_1 and

K(a1,…,am)=amK(a1,…,am−1)+K(a1,…,am−2).K(a_1,\ldots,a_m)=a_mK(a_1,\ldots,a_{m-1})+K(a_1,\ldots,a_{m-2}).

For m≥2m\ge2 these continuants give

M(a1)⋯M(am)=(K(a1,…,am)K(a1,…,am−1)K(a2,…,am)K(a2,…,am−1)).M(a_1)\cdots M(a_m)= \begin{pmatrix} K(a_1,\ldots,a_m)&K(a_1,\ldots,a_{m-1})\\ K(a_2,\ldots,a_m)&K(a_2,\ldots,a_{m-1}) \end{pmatrix}.

The determinant is (−1)m(-1)^m, and reversing a word leaves its continuant unchanged.

Prescribed period lengths for Browkin's second algorithm

Murru, Romeo and Santilli asked whether every even period occurs for infinitely many square roots of integers under Browkin’s second algorithm [15 Conjecture 20]. We adapt the palindromic construction of Capuano, Murru and Terracini for Browkin’s first algorithm [6 Theorem 5.6] to the alternating truncations and the sign correction in Browkin II.

Theorem 3.1. Let pp be an odd prime and let h≥2h\ge2 be even. There is a nonsquare integer DD such that a square root of DD in Qp\mathbb{Q}_p has a Browkin II expansion of minimal period hh. If (p,h)≠(3,2)(p,h)\ne(3,2), there are infinitely many such integers DD.

Admissible expansions

Browkin’s second algorithm [4, 15] starts at α0=α\alpha_0=\alpha and uses (3) with

an={s(αn),n even,t(αn),n odd and ∣αn−t(αn)∣p=1,t(αn)−sgn⁡t(αn),n odd and ∣αn−t(αn)∣p<1.(4)a_n= \begin{cases} s(\alpha_n), & n\ \text{even},\\ t(\alpha_n), & n\ \text{odd and }|\alpha_n-t(\alpha_n)|_p=1,\\ t(\alpha_n)-\operatorname{sgn}t(\alpha_n), & n\ \text{odd and }|\alpha_n-t(\alpha_n)|_p<1. \end{cases} \tag*{(4)}

For n≥1n\ge1, odd complete quotients have norm greater than 11 and even complete quotients have norm 11. Indeed, an even remainder belongs to pZpp\mathbb{Z}_p, while the correction at an odd step makes the remainder a unit. Thus even partial quotients from index 22 on are nonzero elements of Σp\Sigma_p, and odd partial quotients are nonintegral. Every eventual period is consequently even. Negating the input negates all partial quotients, so the period length of a square root does not depend on its sign.

Definition 3.2. A finite or infinite sequence (bn)(b_n) with consecutive indices is admissible if bn∈Σp∖{0}b_n\in\Sigma_p\setminus\{0\} for even nn, and bn∈Z[1/p]b_n\in\mathbb{Z}[1/p] with ∣bn∣p>1|b_n|_p>1 for odd nn, subject to the following condition. An odd entry is either uncorrected, with ∣bn∣<1/2|b_n|<1/2, or corrected, with 1/2<∣bn∣<11/2<|b_n|<1. In the latter case its next entry, when present, must be −sgn⁡bn-\operatorname{sgn}b_n.

References

  1. [1]S. Barbero, U. Cerruti and N. Murru, Periodic representations for quadratic irrationals in the field of p-adic numbers. Math. Comp. 90, 2267–2280 (2021). 10.1090/mcom/3640DOI
  2. [2]S. Barbero, N. Murru and M. Urani, Periodicity and period-length bounds for Browkin p-adic continued fractions. Preprint, arXiv:2609.15531 (2026). 10.48550/arXiv.2609.15531arxiv.org/abs/2609.15531
  3. [3]J. Browkin, Continued fractions in local fields, I. Demonstratio Math. 11, 67–82 (1978). 10.1515/dema-1978-0108
  4. [4]J. Browkin, Continued fractions in local fields, II. Math. Comp. 70, 1281–1292 (2001). 10.1090/S0025-5718-00-01296-5DOI
  5. [5]L. Capuano, M. Mula, L. Terracini and F. Veneziano, p-adically convergent loci in varieties arising from periodic continued fractions. Res. Number Theory 12, Article 86 (2026). 10.1007/s40993-026-00770-xarxiv.org/abs/2402.00739
  6. [6]L. Capuano, N. Murru and L. Terracini, On periodicity of p-adic Browkin continued fractions. Math. Z. 305, Article 17 (2023). 10.1007/s00209-023-03333-3arxiv.org/abs/2010.07364
  7. [7]L. Capuano, F. Veneziano and U. Zannier, An effective criterion for periodicity of ℓ-adic continued fractions. Math. Comp. 88, 1851–1882 (2019). 10.1090/mcom/3385DOI
  8. [8]M. Choudhuri and P.J. Makadiya, On a continued fraction algorithm in finite extensions of Q_p and its metrical theory. Period. Math. Hungar. 91, 124–146 (2025). 10.1007/s10998-025-00634-4. Preprint version, arXiv:2407.04276.arxiv.org/abs/2407.04276
  9. [9]T.-C. Dinh, L. Kaufmann and H. Wu, Berry–Esseen bound and local limit theorem for the coefficients of products of random matrices. J. Inst. Math. Jussieu 23, 705–735 (2024). 10.1017/S1474748022000561
  10. [10]C. Finch and L. Jones, On the irreducibility of {−1, 0, 1}-quadrinomials. Integers 6, A16 (2006). Journal PDF.DOI
  11. [11]H. Furstenberg, Noncommuting random products. Trans. Amer. Math. Soc. 108, 377–428 (1963). 10.1090/S0002-9947-1963-0163345-0DOI
  12. [12]C. Hooley, On the number of divisors of quadratic polynomials. Acta Math. 110, 97–114 (1963). 10.1007/BF02391856DOI
  13. [13]W. Ljunggren, On the irreducibility of certain trinomials and quadrinomials. Math. Scand. 8, 65–70 (1960). 10.7146/math.scand.a-10593DOI
  14. [14]N. Murru and G. Romeo, A new algorithm for p-adic continued fractions. Math. Comp. 93, 1309–1331 (2024). 10.1090/mcom/3890
  15. [15]N. Murru, G. Romeo and G. Santilli, On the periodicity of an algorithm for p-adic continued fractions. Ann. Mat. Pura Appl. 202, 2971–2984 (2023). 10.1007/s10231-023-01347-6arxiv.org/abs/2201.12019
  16. [16]N. Murru and L. Terracini, On p-adic multidimensional continued fractions. Math. Comp. 88, 2913–2934 (2019). 10.1090/mcom/3450. Preprint version, arXiv:1805.00072.arxiv.org/abs/1805.00072
  17. [17]N. Murru and L. Terracini, On the finiteness and periodicity of the p-adic Jacobi–Perron algorithm. Math. Comp. 89, 2913–2930 (2020). 10.1090/mcom/3540. Preprint version, arXiv:1901.04922.arxiv.org/abs/1901.04922
  18. [18]N. Murru and L. Terracini, Simultaneous approximations to p-adic numbers and algebraic dependence via multidimensional continued fractions. Ramanujan J. 56, 67–86 (2021). 10.1007/s11139-021-00466-zarxiv.org/abs/1906.09570
  19. [19]M. Newman, D. Shanks and H.C. Williams, Simple groups of square order and an interesting sequence of primes. Acta Arith. 38, 129–140 (1980). 10.4064/aa-38-2-129-140DOI
  20. [20]T. Pejković, Nonperiodic p-adic continued fractions of quadratic irrationals. Preprint.
  21. [21]T. Pejković, Nonperiodic quadratic Browkin continued fractions. Preprint.
  22. [22]T. Pejković, Real limits and period lengths of Schneider’s p-adic continued fractions. Preprint.
  23. [23]H. Rao and S. Yasutomi, Ergodicity for p-adic continued fraction algorithms. Indag. Math. (N.S.) 32, 759–776 (2021). 10.1016/j.indag.2021.04.001arxiv.org/abs/2009.11041
  24. [24]G. Romeo, Continued fractions in the field of p-adic numbers. Bull. Amer. Math. Soc. (N.S.) 61, 343–371 (2024). 10.1090/bull/1819arxiv.org/abs/2306.14837
  25. [25]G. Romeo, Real convergence and periodicity of p-adic continued fractions. Ramanujan J. 68, article 112 (2025). 10.1007/s11139-025-01264-7arxiv.org/abs/2410.09215
  26. [26]A.A. Ruban, Certain metric properties of the p-adic numbers. Siberian Math. J. 11, 176–180 (1970). 10.1007/BF00970247DOI
  27. [27]A. Saito, J. Tamura and S. Yasutomi, Multidimensional p-adic continued fraction algorithms. Math. Comp. 89, 351–372 (2020). 10.1090/mcom/3458. arXiv:1705.06122v3.arxiv.org/abs/1705.06122
  28. [28]H.P. Schlickewei, On linear forms with algebraic coefficients and Diophantine equations. J. Number Theory 9, 381–392 (1977). 10.1016/0022-314X(77)90073-7DOI
  29. [29]Th. Schneider, Über p-adische Kettenbrüche. Symposia Mathematica, Vol. IV (INDAM, Rome, 1968/69), 181–189. Academic Press, London (1970).
  30. [30]J. H. Silverman, The Arithmetic of Elliptic Curves, 2nd ed., Chapter IX. Springer, Dordrecht (2009). 10.1007/978-0-387-09494-6
  31. [31]Z. Wang and Y. Deng, Convergence, finiteness and periodicity of several new algorithms of p-adic continued fractions. Math. Comp. 93, 2921–2942 (2024). 10.1090/mcom/3948. Preprint version, arXiv:2309.05601.DOI
  32. [32]S. Yasutomi, Certain multidimension p-adic continued fraction algorithm and cubic numbers. In: Diophantine Analysis and Related Fields 2018, Abstracts of the Talks, p. 2, Keio University, Yokohama (2018). Conference abstract.
  33. [33]S. Yasutomi, Certain continued fraction algorithm converging simultaneously under R and Qₚ. RIMS Kôkyûroku 2285, 36–42 (2024). Kyoto University Research Information Repository.
  34. [34]S. Yasutomi, Simultaneous convergent continued fraction algorithm for real and p-adic fields with applications to quadratic fields. Funct. Approx. Comment. Math. 72, 61–94 (2025). 10.7169/facm/240514-24-5. Preprint version, arXiv:2309.09447v1, whose numbering is used here.arxiv.org/abs/2309.09447
  35. [35]S. Yasutomi, A. Saito and J. Tamura, Multidimensional p-adic continued fraction algorithms (in Japanese). RIMS Kôkyûroku 2092, 63–74 (2018). Kyoto University repository.

Paper details

vlnc:W_ayppwezj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 4

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI ChatGPT, Anthropic Claude Opus

View statement
Looking for related papers…
Contents