On a continued fraction algorithm in finite extensions of and its metrical theory
Abstract.
We develop a continued fraction algorithm in finite extensions of generalising certain algorithms in , and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the associated continued fraction maps for our algorithms using subsequence ergodic theory and moving averages.
Mathematics Subject Classification, Primary: J, J; Secondary: J, A.
Keywords: Continued fractions, finite extensions of , continued fraction map, exactness, metric theory.
1. Introduction
Being an indispensable tool in number theory, especially in Diophantine approximation, the study of continued fractions has attracted many mathematicians over the years. The simple or classical continued fraction expansion of a real number is an expression of the form
(1) |
which is also written as with ’s being natural numbers and for (see [15] or [19] for more details). Here, ’s are called the partial quotients of the continued fraction expansion of . If , then the rational numbers converges to , and is called the th convergent to the continued fraction of . The classical continued fraction for real numbers has nice arithmetical properties such as rational numbers have finite continued fraction expansion; convergents are the best approximants among other rational numbers; quadratic irrationals have periodic continued fraction expansion expansions and vice versa, this fact is known as Lagrange’s theorem (see [19] for more details). The reader may look at [17] for various real continued fractions apart from the classical (simple) one. The starting of continued fraction theory for complex numbers goes back to when A. Hurwitz ([16]) described the nearest integer continued fraction algorithm in the field of complex numbers, the partial quotients being elements of the ring of Gaussian integers. He also proved a version of lagrange’s theorem as well. See [11], [10] for more recent developments and a general approach to continued fraction theory in this setup.
It is quite natural to study continued fractions in the non-Archimedean setup as well. The reader is referred to [32] for a comprehensive introduction to the theory of continued fraction and its relation to Diophantine approximation in positive characteristics. See also the survey article [22] by Lasjaunias. For continued fraction in the field of Laurent series in one indeterminate over a finite field , viz. , there is a natural choice of a set for the set of partial quotients, viz. the polynomial ring . The continued fraction in this setup is very well-behaved. For example, any element in has a finite continued fraction expansion, the convergents (which naturally belong to ) provide the best approximation, in fact it is true that if and is such that , then is a convergent from the continued fraction expansion of . A version of Lagrange’s theorem is true as well in this setup, see [32] or [22] for more details.
In , Mahler ([25]) initiated the study of continued fractions in the field of p-adic numbers. There are mainly two types of continued fractions in the field of -adic numbers, one was introduced by Schneider ([33]) in , and the other was introduced by Ruban [31] in . Rational numbers need not have finite continued fraction expansion with respect to these algorithms. See [5] for rational numbers having infinite expansion with respect to Schneider’s algorithm. In fact, Wang [34] and Laohakosol [21] independently showed that a -adic number is rational if and only if the Ruban continued fraction expansion of is either finite or periodic. In , Browkin ([3]) modified Ruban’s algorithm and proved that every rational number has a finite continued fraction expansion. Another desirable arithmetical property of any continued fraction is periodic expansion (the periodicity property) of quadratic irrational which is known as Lagrange’s theorem in the case of real numbers. In [4], Browkin modified his algorithm further and showed that has periodic continued fraction expansion for certain positive integers for . Though, the same is not true for larger values of . So, Lagrange’s theorem is not true in this setup. See also references cited there in [4] for various work related to periodicity prior to Browkin’s ([4]) work in . Many research works have been done in recent times in which people have presented many modified algorithms to achieve the periodicity and other desirable properties of continued fractions in the field of -adic numbers. See for example [9], [6],[8],[27], [26], and the references cited there in. See also the survey article by Romeo ([30]) for a comprehensive history of the development of the continued fraction theory in the field of -adic numbers.
It is quite natural to consider continued fraction in finite extensions of which is left-out in the above discussion while considering continued fractions in all locally compact fields. In this article, we consider canonical extensions of the algorithms of Ruban and Browkin for in its finite extensions. Given any finite (necessarily simple) extension of , we consider this extension in two steps, viz. with a totally ramified extension, and with an unramified extension (see next section for more details). In our algorithms, the partial quotients are elements from the set . We show that any has a unique continued fraction expansion, and given any sequence of partial quotients , converges to an element of . For a few small degree unramified extensions of the form , we show that any element of has a finite continued fraction expansion.
In this article, we are also going to discuss the metrical theory of the associated continued fraction map. In the case of classical continued fraction for real numbers the Gauss map or the continued fraction map is defined as
where denotes the fractional part of . It is well known that is ergodic with respect to the Gauss measure (see [14]). For the ergodicity of the continued fraction map for a more general class of continued fraction, see [18]. For complex continued fraction, the ergodicity of the maps associated with the nearest integer complex continued fractions over imaginary quadratic fields is discussed in a recent paper of Nakada et al. [13]. They, in fact, showed that the continued fraction map is exact (see Section for definition). See also some references in [13] for some earlier works related to the metrical theory of complex continued fractions.
In the non-Archimedean settings, Berthe and Nakada [2] proved the ergodicity of the continued fraction map in positive characteristic, and as an application they obtained various metrical results regarding the averages of partial quotients, average growth rates of the denominators of the convergents, etc. In [23], Lertchoosakul and Nair proved the exactness of the continued fraction map using which they could consider more general averages concerning the partial quotients and the growth rate of the denominator of the convergents. The quantitative version of the metric theory of the continued fraction map in this setup was considered by the same authors in a subsequent paper [24]. The reader is referred to [12] for quantitative metrical results concerning real continued fraction.
In this article, we discuss metrical theory of continued fractions in finite extension of . We show that the associated continued fraction map is Haar measure preserving and exact. Then we obtain various metrical results analogous to the results of [23] concerning asymptotic behaviour of various quantities related to partial quotients, denominator of the convergents, etc. In these results, general averages using subsequence ergodic theory and moving averages are considered as done in [23].
2. Preliminary
For a prime number , the field of -adic numbers is the set of all Laurent series in of the form
The -adic valuation on is defined as follows: if , then
Then the -adic absolute value of is given by
when , and . The field of -adic numbers is the completion of with respect to this absolute value. Let be a finite extension of of degree , i.e., . We may then take as a convenient vector space basis for over the field . Otherwise said, any element can be written uniquely as
Since every finite extension is an algebraic extension, we have for every that there is some monic irreducible polynomial
of degree at most and coefficients such that in . The norm map for the finite field extension is then defined as
Our absolute value on extends uniquely to in the following manner (see [20] for details):
Let us choose an element of maximal absolute value smaller than 1, say . Define
and
We have , and the residue field is a finite extension of .
Definition 1.
The residue degree of the finite extension of is the positive integer , where is the residue field of . A finite extension of is said to be totally ramified if .
We also have that , where . This is because upto isomorphism there is exactly one finite field having elements.
Definition 2.
The ramification index of equals . A finite extension of is called unramified if .
For the uniformizer , we have thereby giving us
Any element can be represented as for some suitable and . Then,
The integers and given above satisfy , where is the degree of the extension. We recall that [29, Corollary 4-26] there exists an unramified subextension of degree such that is a totally ramified extension of degree . Also, there exists a such that with [20, § III.3]. (To boot, we may and do take to be some primitive -th root of unity)
Lemma 3.
Let be as above. Then, there exists some such that and .
Proof.
We know that the value groups of and are and , respectively. Let us, therefore, choose some such that . As is a finite extension, every element of is algebraic over the field . In particular, our chosen element satisfies some minimal monic polynomial
and .
Now, we will like to show that . It is equivalent to establishing that the minimal polynomial of has degree . Suppose .
We have by the unique extension of the non-archimedean absolute value to . Here, for some implying that . This is possible iff but , a contradiction. Thus, there exists a such that with . ∎
Every can then be written as
(2) |
Now let and be the sets inside defined by:
(3) |
and
(4) |
Note that the partial quotients for Ruban’s -adic continued fraction are elements of , whereas, the partial quotients for Browkin’s algorithm are elements of . In a moment, we define a set , the elements of which will be used as partial quotients for the continued fraction algorithm developed in this article. We may either use or while defining the set . In the first case, we get a generalization of Ruban’s algorithm in finite extensions of , whereas, we get a generalization of Browkin’s algorithm in the second case. From now on, we use the notation for both the sets and with the understanding that whenever we use , the discussion applies to both and . Any two distinct numbers in will have -adic distance at least one giving us that it is a -uniformly discrete set. Furthermore, every non-zero element has an absolute value at least one. Generalizing this observation for all finite -adic extensions, we have the following.
Lemma 4.
The set
is -uniformly discrete. In particular, every non-zero element in has an absolute value at least one.
Proof.
Let with . This happens iff
where at least one of the coefficients ’s (say ) is a non-zero element from the set . Consider
(5) |
Assume . Since is a primitive -th root of unity, it is plain that belongs to . Without loss of generality, we may assume that has the maximum absolute value in the representation of given by (5). This is because by choosing such that
and replacing with , we can ensure that the coefficient of has maximum absolute value amongst all the ’s. It then follows that
(6) |
On reducing the above equation modulo , we get that
(7) |
where ’s are elements of the residue field . This leads to a contradiction as the degree of the residue field over is . Therefore, . We will in fact have that
with for some or for some while . This implies that for any pair of indices with at least one or non-zero and there exists such that
Therefore,
Hence, is a -uniformly discrete set. ∎
The metric balls in will have radius for . More precisely, for and , let
be the ball around of radius . Let denote the Haar measure on the local field (see Chapter of [29] for existence of Haar measure) and it is normalized in such a way that . Note that
and, therefore,
(8) | ||||
by [29, Proposition 4-13]. Next two technical lemmas are useful for computing measure of various metric balls inside .
Lemma 5.
For , the ball is the same as the set
Proof.
First suppose . Then, where for all . Since and , we obtain . Otherwise said, .
Conversely, let so that , where for at least one pair . For each and , we may write
with all terms of the form contained in , and is such that for all . Thus, where belongs to the set introduced in Lemma 4 while . This implies that and . All in all, or equivalently, . ∎
Lemma 6.
Let and . Then the ball is the same as the set
Proof.
First we show that . Let . Then , where for , and for . Note that for all , and for all , . Also, and , we get . This shows that .
To prove the converse, suppose . Then there exists a pair such that
If , then . So, . And if , then . So, . Thus, . ∎
Now we are in a position to calculate the measure of any ball around zero inside .
Proposition 7.
The measure of the ball equals .
Proof.
Fix some . By (8) we know that
Since , where
for all , we have a disjoint union decomposition
Therefore,
where the disjoint union is taken over all possible combinations
. By the translation invariant property of ,
So,
It follows that . In general,
for all and . ∎
As is a uniformly discrete set, we can count the number of elements inside a set of elements with a fixed absolute value. This counting will be useful in some of the subsequent sections. Let be the set given by
For , for some if and only if for all . Then it follows that for each ,
Let us denote by the set of all such that . Also let be a positive integer and . Writing an element as
note that if for some or for some , then the set . Then it follows that
Now, let . By a similar argument, we also obtain
Hence, for all ,
(9) |
3. Continued fraction algorithm and finiteness property
Now we describe a continued fraction algorithm for elements in any finite extension of . This algorithm generalizes Ruban’s algorithm of (for ), as well as Browkin’s algorithm (for ). Our algorithm is a very natural extension of Ruban’s and Browkin’s algorithm with partial quotients coming from the set .
The -adic floor function for Ruban’s algorithm is a function from to defined as follows: for with for and for ,
Using this floor function, we define a floor function on which is a function from to , as follows:
(10) |
It is easy to see that
(11) |
for any .
Following the existing literature, we call an expression of the form
with and for , a continued fraction which is also written as . It is a finite continued fraction if the sequence is a finite one, otherwise, it is an infinite continued fraction. We call ’s the partial quotients of the continued fraction. We write,
with , , and call it the th convergent of the continued fraction . It is easy to see that the sequence and satisfy the following recurrence relations:
with , , , . The numerator and denominator of the convergents also satisfy
(12) |
Now we discuss the convergence properties of the continued fraction in our setup.
Lemma 8.
Let with for . Then the sequence of convergents , converges to an element of . Moreover,
Proof.
Note that,
It is also easy to see that
which in turn implies that is an increasing sequence as for . Then it follows that is an increasing sequence as well. Now, using the properties of ultrametric absolute value, it can be easily seen that
As is increasing, it follows that is a Cauchy sequence, and hence converges to some . ∎
Now, given any , we generate its continued fraction expansion as follows:
If for some , then is not defined and the sequences and are finite. Otherwise, two infinite sequences are generated by the above construction. Here, ’s the partial quotients and ’s the complete quotients corresponding to the continued fraction expansion of . It is easy to see that .
Now, suppose be such that the sequences and are infinite, and let
We have for by (11). Then it follows from Lemma 8 that the sequence of convergents converges to .
Remark 9.
The definition of continued fraction in this article differs from the definition of continued fractions discussed by Capuano et al. in [7]. Our defining conditions of floor function are less restrictive; in fact, we do not impose a condition like the nd condition in Definition of [7]. Also, our algorithm is less abstract which enables us to discuss the metrical theory of the associated continued fraction map. The following example shows that the nd condition of Definition of [7] may not be satisfied in our setup.
Example 10.
Let . Then and is a totally ramified extension of . If is given by , then
Now, let be an ultrametric normalized absolute value on the number field such that is a non-Archimedean place lying over the prime . Then
which violates the nd condition of Definition of [7].
One of the main difficulties for continued fractions in the -adic setup is that rational numbers do not necessarily have finite continued fraction expansions (also known as finiteness property) for many algorithms. In , Browkin modified Ruban’s algorithm to achieve the finiteness property for -adic continued fraction. The fact that Euclidean absolute value of the partial quotients in Browkin’s algorithm is less than was crucially used in Browkin’s proof of finiteness. In our setup, we prove the finiteness property for some small degree extensions of in the case of generalization of Browkin’s algorithm, i.e., in the case .
Let be either modulo or modulo . In the first case, we take , where is the root of the polynomial . In the nd case we take , where is the root of the irreducible polynomial . We show that the finiteness property holds in the cases of these extensions of . Note that when , then and gives rise to the same extension of . For a cyclotomic extension of , where is some primitive th root of unity, we define the Galois height of field rational elements as follows: for ,
where the maximum is taken over all (distinct modulo conjugation) Galois embeddings of inside , and denotes the Euclidean norm of the complex number . The following lemma gives us the required bound on the Galois heights which will be useful in proving the finiteness property.
Lemma 11.
If , then there exists such that and .
Proof.
Here, for giving us that
for all when . Again,
for all when . Then it is clear that we can find a suitable such that the assertions of the lemma hold.
∎
Proposition 12.
Let where when and when . Also let , i.e., the partial quotients of the continued fraction expansion of any element of are elements of the form
Then, any has a finite continued fraction expansion.
Proof.
We use a suitable generalisation of the method used in Proposition of [7]. As , we can express as
with , and . We define two sequences and as follows:
Then, it is easy to see that
and, consequently,
(13) |
It is also easy to see that the sequence satisfies the recurrence relation
(14) |
Clearly, . Also, by definition of and (13), we have . Hence, . Taking the Galois height of both sides of (14), and then dividing by , we have
Let , , . Then
Since , it follows from Lemma of [7] that as . Hence there exists such that since . This means that for some , and consequently, has a finite continued fraction expansion. ∎
4. Exactness
Let be a finite extension of , and be the floor function defined in 10. The continued fraction map is defined on inside , as follows:
(15) |
where is as defined in (10). In this section, we shall prove the exactness of , and in the subsequent section we prove various metrical results as consequences of exactness. We shall be considering the continued fraction map corresponding to the extension of Ruban’s algorithm in finite extensions of , though similar assumptions hold for the continued fraction map corresponding to the extension of the Browkin’s algorithm as well. Now, let and be the continued fraction axpansion of . To emphasize the dependence on , we will also use to denote the th partial quotient of the continued fraction expansion of , i.e., . Note that,
for all and .
Recall that a measure preserving dynamical system is said to be exact if
where is the trivial sub -algebra of generated by the sets of measure or . For , and , let denote the cylinder set of length , i.e.,
(16) |
The following lemma gives an alternate description of a cylinder set which will be helpful in calculating its measure. The proof of this lemma is similar to the proof of Lemma of [23].
Lemma 13.
For any finite sequence ,
Because of the above lemma, it is not hard to see that the Borel -algebra on is generated by the cylinder sets described above. We denote by the Borel -algebra on . Also, let be the restriction of the Haar measure on , and be the continued fraction map on defined above. We first show that is measure-preserving. Note that two cylinders and of the same length are disjoint if and only if for some .
Lemma 14.
The dynamical system is measure-preserving.
Proof.
Since the cylinder sets generate the Borel -algebra, it is enough to show that is measure-preserving on cylinder sets. For any cylinder set , there exists and such that , and consequently,
The inverse image of under is given by a disjoint union as follows:
(17) |
Then
∎
The following technical lemma which is analogous to Lemma of [23], is a crucial ingredient in proving exactness of the continued fraction map.
Lemma 15.
For the dynamical system , if , then for any natural number and cylinder set , we have
Proof.
It is enough to consider to be a cylinder set. Let . Then there exist and such that and . Now,
Also, . Then,
∎
Now we show that the continued fraction map is exact.
Theorem 16.
The dynamical system is an exact dynamical system.
Proof.
It is enough to show that . Let . Then for each , there exists such that and . Now, for each cylinder set of length ,
Then it follows from Lemma of [23] that or , consequently, . ∎
5. Metrical results
Now we obtain results analogous to the metrical results of [23] in our setup. Since is exact, it is weak-mixing as well, i.e.,
as for any . Weak-mixing property of the continued fraction map enables one to consider metrical results in the context of certain subsequences. This is done in [28] for continued fraction map in the case of real numbers, and in [23] in the positive characteristic setup. We do a similar study here for continued fraction map on inside . Before proceeding further we recall two definitions which plays crucial role in the discussion of metrical theory using subsequences.
Definition 17.
A strictly increasing sequence of positive integers is said to be -good universal, if for each dynamical system and , the limit
exists -almost everywhere.
Definition 18.
A sequence of real numbers is called uniformly distributed modulo 1, if for each interval , we have
where denotes the length of and denotes the fractional part of .
Please see [23] for examples of -good universal sequences. The following proposition is a consequence of weak-mixing, the proof of which can be found in [28].
Proposition 19.
Let be a weak-mixing dynamical system. Suppose is an -good universal sequence of natural numbers such that is uniformly distributed modulo for any irrational number . Then for any ,
-almost everywhere.
Proposition 20.
Let be an increasing function such that
For any natural number and non-negative real numbers , let the generalized average be defined as
If is an -good universal sequence of natural numbers such that is uniformly distributed modulo for any irrational number , then
-almost everywhere.
Proof.
Apply Proposition 19 to the function . ∎
The following is also a consequence of Proposition 19, in which one considers a function from to .
Proposition 21.
Suppose that is a function such that
and if is an -good universal sequence of natural numbers such that is uniformly distributed modulo for any irrational number . Then
-almost everywhere.
Proof.
Now, we calculate the asymptotic frequency of partial quotients being some particular element of .
Lemma 22.
If is a sequence as in the above propositions, then for any ,
almost everywhere with respect to .
Proof.
In the following two results, we assume that is an -good universal sequence of natural numbers such that is uniformly distributed modulo for any irrational number . The next result is a version of Khinchin’s theorem regarding the geometric mean of the partial quotients in the case of real continued fraction.
Proposition 23.
For almost every with respect to the Haar measure,
Proof.
In the following theorem, we find the asymptotic frequency of partial quotients taking some specified absolute value (or greater or equal to some specified absolute value or absolute values in certain range).
Theorem 24.
For any positive integer ,
and -almost everywhere.
If is another positive integer with , then
-almost everywhere.
Proof.
Given a measure-preserving transformation on a probability measure space , we know that converges almost everywhere. But what happens if we consider moving averages? This means, given a sequence of pairs of positive integers what can be said about the convergence of for almost every . In [1], necessary and sufficient conditions were given for this kind of moving averages to converge.
Let be an infinite collection of points inside . Define
Following [23], we call a sequence of pairs of natural numbers Stoltz if there exists a function tending to infinity with such that
for some inside , and and such that
where denotes the cardinality of the set .
The following proposition which can be considered as the moving average version of Proposition 19, is the base of the metrical results corresponding to the continued fraction map in the context of moving averages. The proof of the proposition is essentially contained in [1].
Proposition 25.
Let be an ergodic dynamical system, and let be a Stoltz sequence of natural numbers. Then for any ,
-almost everywhere.
The readers are referred to [23] for some examples of Stoltz sequence, and to [1] for some sequence of pairs of natural numbers for which the assumption of the above proposition fails.
Now we state the metrical results using moving averages. The results are analogous to the results mentioned above, and proofs are similar.
Proposition 26.
Let and be as in Proposition 20, and let be a Stoltz sequence of pairs of natural numbers. Then
almost everywhere with respect to .
Proposition 27.
Suppose is a function as in Proposition 21, and be a Stoltz sequence of pairs of natural numbers. Then
-almost everywhere.
We include the other results in the following theorem.
Theorem 28.
Let be a Stoltz sequence of pairs of natural numbers. We consider all the statements mentioned below in the almost everywhere sense with respect to the measure .
Acknowledgement .
Both the authors are thankful to Dr. L. Singhal for many helpful discussions and some insightful suggestions especially in Lemma 4. He also suggested using the bounds in Lemma 11 in the proof of Proposition 12. Prashant J. Makadiya acknowledges the support of the Government of Gujarat through the SHODH (Scheme of Developing High-Quality Research) fellowship. Prashant J. Makadiya also thanks the Council of Scientific and Industrial Research (CSIR), India for their support through the CSIR-JRF fellowship.
References
- [1] Alexandra Bellow, Roger Jones, and Joseph Rosenblatt. Convergence for moving averages. Ergodic Theory Dynam. Systems, 10(1):43–62, 1990.
- [2] Valérie Berthé and Hitoshi Nakada. On continued fraction expansions in positive characteristic: equivalence relations and some metric properties. Expo. Math., 18(4):257–284, 2000.
- [3] Jerzy Browkin. Continued fractions in local fields. i. Demonstratio Math., 11(1):67–82, 1978.
- [4] Jerzy Browkin. Continued fractions in local fields. ii. Math. Comp., 70(235):1281–1292, 2001.
- [5] P. Bundschuh. -adische Kettenbrüche und Irrationalität -adischer Zahlen. Elem. Math., 32(2):36–40, 1977.
- [6] Laura Capuano, Nadir Murru, and Lea Terracini. On the finiteness of -adic continued fractions for number fields. Bull. Soc. Math. France, 150(4):743–772, 2022.
- [7] Laura Capuano, Nadir Murru, and Lea Terracini. On the finiteness of -adic continued fractions for number fields. Bull. Soc. Math. France, 150(4):743–772, 2022.
- [8] Laura Capuano, Nadir Murru, and Lea Terracini. On periodicity of -adic Browkin continued fractions. Math. Z., 305(2):Paper No. 17, 24, 2023.
- [9] Laura Capuano, Francesco Veneziano, and Umberto Zannier. An effective criterion for periodicity of -adic continued fractions. Math. Comp., 88(318):1851–1882, 2019.
- [10] S. G. Dani. Continued fraction expansions for complex numbers—a general approach. Acta Arith., 171(4):355–369, 2015.
- [11] S. G. Dani and Arnaldo Nogueira. Continued fractions for complex numbers and values of binary quadratic forms. Trans. Amer. Math. Soc., 366(7):3553–3583, 2014.
- [12] C. de Vroedt. Metrical problems concerning continued fractions. Compositio Math., 16:191–195 (1964), 1964.
- [13] Hiromi Ei, Hitoshi Nakada, and Rie Natsui. On the ergodic theory of maps associated with the nearest integer complex continued fractions over imaginary quadratic fields. Discrete Contin. Dyn. Syst., 43(11):3883–3924, 2023.
- [14] Manfred Einsiedler and Thomas Ward. Ergodic theory with a view towards number theory, volume 259 of Graduate Texts in Mathematics. Springer-Verlag London, Ltd., London, 2011.
- [15] G. H. Hardy and E. M. Wright. An introduction to the theory of numbers. Oxford University Press, Oxford, sixth edition, 2008. Revised by D. R. Heath-Brown and J. H. Silverman, With a foreword by Andrew Wiles.
- [16] A. Hurwitz. Über die Entwicklung complexer Grössen in Kettenbrüche (german). Acta Math., 11:187–200, 1887.
- [17] Svetlana Katok and Ilie Ugarcovici. Theory of -continued fraction transformations and applications. Electron. Res. Announc. Math. Sci., 17:20–33, 2010.
- [18] Svetlana Katok and Ilie Ugarcovici. Applications of -continued fraction transformations. Ergodic Theory Dynam. Systems, 32(2):755–777, 2012.
- [19] A. Ya. Khinchin. Continued Fractions, volume 49 of The Mathematical Gazette. University of Chicago Press, 1964. https://doi:10.1017/S0025557200053328.
- [20] Neal Koblitz. -adic Numbers, -adic Analysis, and Zeta-Functions, volume 58 of Graduate Texts in Mathematics. Springer-Verlag New York, NY, 1984.
- [21] Vichian Laohakosol. A characterization of rational numbers by -adic Ruban continued fractions. J. Austral. Math. Soc. Ser. A, 39(3):300–305, 1985.
- [22] A. Lasjaunias. A survey of Diophantine approximation in fields of power series. Monatsh. Math., 130(3):211–229, 2000.
- [23] Poj Lertchoosakul and Radhakrishnan Nair. On the metric theory of continued fractions in positive characteristic. Mathematika, 60(2):307–320, 2014.
- [24] Poj Lertchoosakul and Radhakrishnan Nair. On the quantitative metric theory of continued fractions in positive characteristic. Proc. Edinb. Math. Soc. (2), 61(1):283–293, 2018.
- [25] Kurt Mahler. On a geometrical representation of -adic numbers. Ann. of Math. (2), 41:8–56, 1940.
- [26] Nadir Murru and Giuliano Romeo. A new algorithm for -adic continued fractions. Math. Comp., 93:1309–1331, 2024.
- [27] Nadir Murru, Giuliano Romeo, and Giordano Santilli. On the periodicity of an algorithm for -adic continued fractions. Ann. Mat. Pura Appl. (4), 202(6):2971–2984, 2023.
- [28] R. Nair. On the metrical theory of continued fractions. Proc. Amer. Math. Soc., 120(4):1041–1046, 1994.
- [29] Dinakar Ramakrishnan and Robert J. Valenza. Fourier analysis on number fields, volume 186 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1999.
- [30] Giuliano Romeo. Continued fractions in the field of -adic numbers. Bull. Amer. Math. Soc. (N.S.), 61(2):343–371, 2024.
- [31] A. A. Ruban. Certain metric properties of the p-adic numbers. Sibirsk. Mat. Ž., 11:222–227, 1970.
- [32] Wolfgang M. Schmidt. On continued fractions and Diophantine approximation in power series fields. Acta Arith., 95(2):139–166, 2000.
- [33] Th. Schneider. Über -adische Kettenbrüche. In Symposia Mathematica, Vol. IV (INDAM, Rome, 1968/69), pages 181–189. Academic Press, London, 1970.
- [34] Lian Xiang Wang. -adic continued fractions. I, II. Sci. Sinica Ser. A, 28(10):1009–1017, 1018–1023, 1985.