Finding both, the continued fraction and the Laurent series expansion of golden ratio analogs in the field of formal power series
Abstract
The focus of this paper is on formal power series analogs of the golden ratio. We are interested in both their continued fractions expansions as well as their Laurent series expansions. Knowing both of them is for instance important for the study of Kronecker type sequences in the theory of uniform distribution.
Our approach studies the Hankel matrices that are determined using the coefficients of the Laurent series expansions.
We discover that both matrices in the decomposition of these Hankel matrices can be described by a simple recursive algorithm based on the continued fraction coefficients of the golden ratio analogs.
The upper triangular factor possesses several nice properties. First, its entries in the special case where the golden ratio analog is can be given by using the Catalan’s triangular numbers. Nicely, this relation together with our findings on the Hankel matrices are used to derive combinatorial identities involving Catalan’s triangular numbers. As a side product we obtain a description of the distribution of the Catalan numbers modulo a prime number.
Second, the upper triangular factor is the columnwise composition of the Zeckendorf-type representations of the powers of . This Zeckendorf representation for polynomials is introduced in the style of the Zeckendorf representation of the natural numbers and it is based on the Fibonacci polynomials instead Fibonacci numbers.
Third, in case of positive characteristic, for each purely periodic golden ratio analog we detect a self-similar pattern in the upper triangular factor of its Hankel matrix. We derive this pattern from a binomial type formula for two non-commutative matrices.
Finally, we exemplary show, how this self similar pattern in the upper triangular factor of its Hankel matrix can be used to describe the Laurent series expansion of a golden ratio analog for which the continued fraction coefficients are given.
Keywords:
golden ratio, formal power series, Fibonacci polynomials, Catalan’s triangular numbers, LU-decomposition of regular Hankel matrices
MSC2010: primary 11B39; secondary 11T99, 11C99.
1 Introduction and Motivation
We remember the golden ratio as a root of the polynomial
and its fractional part as a root of the polynomial
It is well-known that both and are quadratic irrationals in which is the completion field of with respect to the absolute value .
The golden ratio and its inverse are in a certain sense optimal real numbers, namely their simple continued fraction coefficients have lowest possible absolute values , as and , and the latter is contained in the interval .
Note that the th convergent to is and to is , where denotes the th Fibonacci number. The sequence of Fibonacci numbers is recursively defined via where we choose the starting values and .
Now we use – in analogy to the number field – the rational function field where is an arbitrary field, as for example or a finite field with elements. And the pendant to the absolute value is the non-archimedean absolute value , that is defined using the degree valuation as follows.
For every we can find satisfying such that . We write with and . Then the degree of is well-known to be . We define .
The degree valuation of the rational function then is defined as
and the corresponding non-archimedean absolute value
where is here the Euler number.
Now the completion field of with respect to the absolute value is the field of formal Laurent series (also called formal power series), denoted by . Each element in can be written as
here for all and such that and for all .
The degree evaluation of is and the absolute value of is .
In the following we list analogies between and that are of use in this paper.
-
1.
Let satisfying . Then every real number has a unique -adic expansion of the form
with and infinitely many , and is the integer part of satisfying . The latter magnitude is abbreviated to and called the fractional part of .
The element satisfies . Every nonzero element in , can be uniquely written as
with coefficients , and is the polynomial part of contained in . Note that the absolute value of is smaller than . The element is usually abbreviated to and called the fractional part of .
The set of all possible fractional parts, that is
will be abbreviated to in the following.
Note that this set can be alternatively given as
The degree evaluation of satisfies
-
2.
Every real number can be expressed in a continued fraction satisfying for every .
In analogy, every series can be expressed in a continued fraction
with satisfying for every .
-
3.
The th convergent to a non-rational is the finite continued fraction which can be written as with . Both recursively computed via and for every with starting values , and .
Analogously, the th convergent to a non-rational is the finite continued fraction which can be written as with . Both recursively computed via and for every with initial values , and . -
4.
Now an interesting fact is that the denominators or are best approximating in the sense that if
then is a convergent to and if
then is a convergent to .
Moreover, we note that , and
for all satisfying .
-
5.
Finally, we point out two further analogies between and the set of formal power series in the case where is a finite field. We have the following two classifications of :
-
-
is a rational number if and only if for every integer , the -adic expansion of is eventually periodic or finite.
-
-
is a quadratic irrational number if and only if the continued fraction expansion of is infinite and ultimately periodic.
In the case where the field is finite, we have for that the condition is equivalent to that the series expansion is eventually periodic or finite. (See [7, Theorem 1.1])
Moreover, in case of a finite field we have for , that the continued fraction expansion of is ultimately periodic if and only if it is quadratic over (cf. e.g. [7, Theorem 3.1]).
For results and discussions in the case where is not finite, confer e.g. [10].
-
-
In this paper we introduce analogs of the reciprocal of the golden ratio which possesses the “optimal” continued fraction expansion
since all coefficient have lowest possible value . As there are more choices of partial quotients having lowest possible degree , we define a set of golden ratio analogs in .
Definition 1 (Set of golden ratio analogs).
We define the set of golden ratios in as
We are particularly interested in the formal power series representation of specific examples of golden ratio analogs, as e.g. over special fields . We would like to point out that for real numbers in it is a non-trivial problem to determine both, the explicit -adic representation with a fixed base , say or , and its continued fraction coefficients. So far there are only a few examples, where we have information on both representations (see e.g. Shallit [11, 12]). We mention here the number investigated in [11].
Example 1 (Shallit).
Let be an integer and . Then Shallit [11] discovered a certain pattern in the continued fraction of as the limit of the following recursion, e.g., in the case where the pattern can be described as follows: , and for with let
Now in base is .
Note for we may write as .
The question for the formal series expansion of golden ratio analogs is for instance relevant for the investigation of so-called Kronecker type sequences over where is the finite field with elements. Kronecker type sequences, that are introduced as an analogon to the ordinary Kronecker sequence with , are actively investigated in the theory of uniform distribution (cf e.g.[5]). For the sake of completeness we give the definition of Kronecker type sequences.
Definition 2 (Kronecker type sequence).
Let be a finite field and . For , the th element of the Kronecker type sequence determined by is obtained by the following algorithm:
-
1.
Expand in base , i.e. with , then associate with the polynomial by setting
where is a fixed bijection that maps to .
-
2.
Compute the product and take the series expansion of its fractional part,
-
3.
Finally, set
which is always an element of the interval . For short we write this sequence as .
Remark 1.
Note that we can also use the concept of an generating matrix over and the digital method, that was introduced in [8], to define the Kronecker type sequence determined by . The digital method works as follows. Instead of a polynomial associate a vector . Define the generating matrix
with entries , where the are the coefficients in the series expansion of . Then, compute . Finally, set
Note that the generating matrix of any Kronecker type sequence is a Hankel matrix, since for all satisfying . While the generating matrix can be defined over an arbitrary field , the construction algorithm of the sequence in relies on the finiteness of the field.
In the theory of uniform distribution the so-called -discrepancy of Kronecker type sequences is of particular interest as the -discrepancy of ordinary Kronecker sequences is well investigated (cf. for example [1]). The main method for investigating the distribution of Kronecker type sequences applies Walsh functions whereas for the ordinary Kronecker sequence trigonometric functions are used. For the Walsh function approach detailed information on the formal series coefficients is helpful. It is known that one-dimensional Kronecker type sequences are in a certain sense optimal if all continued fraction coefficients of have degree (see e.g. [9, Theorem 4.48]). Therefore the series expansions of golden ratio analogs in , where is a finite field, deserve particular attention.
As already noted in the abstract our approach studies the Hankel matrices that are the generating matrices of the Kronecker type sequences and which are defined using the coefficients of the Laurent series expansions.
Definition 3 (Hankel matrix associated with ).
Let with Laurent series expansion . We define the Hankel matrix related to by setting for all .
We call a matrix regular if for every its upper left submatrix is regular.
In the following lemma we write down a basic property of Hankel matrices over finite fields, that is a consequence of [6, Corollary 1] and points out the relevance of the golden ratio analogs.
Lemma 1.
We denote the Hankel matrix as . Then the following assertion are equivalent.
-
1.
The Hankel matrix is regular.
-
2.
The partial quotients in the continued fraction of have all lowest possible degree .
Proof.
Note that each Laurent series defines a Hankel matrix and vice versa. Now from the definition of the quality parameter of the Kronecker type sequence, which is used in [6], it is easily checked that if and only if the generating Hankel matrix is regular. Now [6, Corollary 1], which states if and only if all continued fraction coefficients of have degree , completes the proof. ∎
In the rest of the paper we aim for explicit formulas for the coefficients in the series expansions of golden ratio analogs, in particular for the specific case where is a finite field .
We start with the most basic example over .
Example 2.
Choose as the binary field and satisfying . Now because the field has characteristic we can make a guess on the series expansion of and verify it by computing . Now for
we obtain
Note that in the before last step we made an index shift and in every step we used the characteristic .
Remark 2.
Note that over a more general field with characteristic greater than or zero, squaring a series is not that trivial. It is ad hoc not clear how to find the expansion of over e.g. where is an odd prime number. The method developed in this paper is based on studying the associated Hankel matrices. As side products we discover plenty of interesting and astonishing results. Just to announce two of them. We give the unique decomposition of the Hankel matrix for any golden ratio analog over , where the columns of and rows of follow easy to define recursions. We identify for specific examples of golden ratio analogs nice patterns in , that will give us a hint on the Laurent series expansion of .
2 The decompositions of the Hankel matrix associated with a golden ratio analog
Throughout this section and will be fixed. Thus the continued fraction of satisfies for all .
We define the sequence of Fibonacci polynomials associated with given by the denominators of the convergents to .
Definition 4 (Fibonacci polynomials associated with ).
For each explicitly given
over a field the sequence of Fibonacci Polynomials
in is defined recursively by for and with initial values and .
Remark 3.
Often the notion “Fibonacci polynomials” is used for in the specific case where is .
We observe that all Fibonacci polynomials associated with satisfy for all . Hence we are able to define a so-called “Zeckendorf representation” in . We note that the sequence of Fibonacci numbers in can be used to represent any non-negative integers in terms of different Fibonacci numbers, i.e. with and only finitely many . For the Zeckendorf representation we require, if then . The latter guaranties the uniqueness of this representation.
Let be the sequence of Fibonacci polynomials associated with and is the sequence of the leading coefficients in , i.e., .
Let with . Usually, is expressed in terms of powers of , i.e. with for and . By the following greedy algorithm one can represent in terms of the Fibonacci polynomials, i.e.,
with and .
Algorithm 1 (-Zeckendorf representation).
Proceed as follows:
-
-
Set , , and .
-
-
For given with proceed as follows: If set and , else express in terms of powers of and use its leading coefficient to define and set
-
-
Finally set .
The following lemma points out an important advantage of the Zeckendorf representation of a polynomial in .
Lemma 2.
Let and having associated -Zeckendorf representation . Then
where is minimal such that .
Proof.
This follows from as is the denominator of the th convergent to and for all and is a non-archimedean valuation, that says for with we have . ∎
Next we define matrices associated to a golden ratio analog based on its continued fraction coefficients.
Definition 5 (Matrices associated to ).
We introduce the tridiagonal matrix associated to as the product of the two matrices , that are defined as follows.
We write with and and define over by
And is the non-singular diagonal matrix .
Using the tridiagonal matrix we recursively construct two matrices and .
The matrix is obtained columnwise: define the first column as and set for . The matrix is obtained row by row, by setting and for .
Note that in the special case where , and as a consequence . In the following theorem we exhibit specific properties of and .
Theorem 1.
We have
-
1.
is a non-singular lower triangular matrix and is a non-singular upper triangular matrix.
-
2.
The th column of collects the coefficients of the -Zeckendorf representation of , namely, if then
-
3.
The product is a Hankel matrix.
-
4.
The product gives the generating matrix associated with .
Proof.
The matrix is a tridiagonal matrix with nonzero entries to the left and to the right of the diagonal. Hence it is an easy consequence from the definition of and that both have nonzero diagonal entries and are upper and lower resp. triangular matrices.
For the second item and for we use .
Suppose for the th column satisfies where . Then
Hence the coefficient to in the -Zeckendorf representation of is , this fits exactly the recursive definition of based on .
The Hankel property of follows from
for all admissible .
It remains to prove the relation with that is by definition a Hankel matrix. Thus comparing the first rows is enough. We start with the first coefficient of
The first convergent to is . The first entry of the first row of is and the second is . From the approximation property of the first convergent we derive
Hence the first two coefficients of the series expansions of and coincide. Now we know, that
hence the first coefficient of is .
For we write in Zeckendorf representation . So the st entry of the first row of is given by .
For the st entry of the first row of , or resp., we use that satisfies
The latter is equivalent to
since . From Lemma 2 we know
Therefore and we obtain
∎
Theorem 1 shows that the powers of , whose upper left entries are related to the coefficients of , and whose first columns determine the columns of , attract attention for our main problem of finding the series expansion of golden ratio analogs.
3 The most basic golden ratio analog
We start with the special case . A well established formula for the Fibonacci Polynomials is the following. Here and later on, a coefficient denotes .
Lemma 3.
For and we have
Proof.
We check the formula for and . Then follows from induction. ∎
We also obtain a formula for the coefficients of the Zeckendorf representations of the powers of , that determine the entries in .
Lemma 4.
Let and be the -Zeckendorf representation of with . Then , for and all other coefficients are . Therefore, we have
where whenever or and for even , otherwise .
Proof.
The formula for is an immediate consequence of the formula for and Theorem 1 item 2. The statement on follows from induction on . ∎
Remark 4.
Let be the matrix over , with the th column defined by the coefficients of in terms of powers of . Then
Then , the identity matrix over . Hence, we obtain, as a side-product, the two combinatorial identities involving Catalans triangle numbers which we define as ,
and
for and , from
and
Note that Catalan’s triangle numbers are also often defined differently by . Hence .
In the following we derive explicit formulas of the series expansion of the golden ratio analog .
We start with the basic example over or with characteristic . From Theorem 1 item 3 we obtain the series expansion from the first row of in Lemma 4. Hence
Because of we obtain for all , and for , , where is the th Catalan number, which can be defined via the Catalan’s triangle numbers by .
We recall the Lucas Theorem for prime numbers , i.e.
with given via the -adic expansion of and .
We expand the even number in base and obtain
Thus
For we write with , then is
Now
This is only nonzero if and . So iff or with . Adding the index we obtain again the series given in Example 2
in characteristic .
For a general finite field with characteristic other than , this simple method above, does not work, as the -adic expansions of and are not that simply related. For the general case we at least obtain the formula for the series expansion of involving the Catalan numbers.
Proposition 1.
For over with characteristic we have for . And for we have
where is the th Catalan number, satisfying .
Remark 5.
Proposition 1 and imply the well-known recurrence relation for the Catalan numbers,
The distribution of the Catalan numbers modulo follows specific regularities that are worked out above for modulus . In moduli , and , these regularities are given in Figure 1. One aim of this paper is a nice formula for the series expansion of over a finite field, which we found already for characteristic .




One way to describe the pattern modulo is to exploit the Lucas Theorem together with the base expansion of and . An alternative approach is the investigation of a certain fractal structure in via searching for pattern in . An advantage of the second approach is, that we can do this for more general .
Let us consider the first approach before we work on the second one in Section 4. Obviously, the question whether multiplication of with causes at least one carry in the -adic expansion of or not is crucial for the first approach.
Lemma 5.
Let be an odd prime number and with unique -adic expansion where .
For the case where , we have
for all .
For , let be maximal such that . Then with , we have
Proof.
We see that for any
(3) |
The case of follows directly from the Lucas Theorem together with (3), the trivial fact that , and .
For we have and we focus on since . Note that
and that .
Hence .
For use with , and . This step is repeated till we use .
∎
This can be used to compute the series expansion of for different odd prime characteristics.
Example 3.
Let . We see that we can build the series expansion by starting with . Then use Step , followed by Step etc.
We describe “Step ” with : For set and repeat the first values of the coefficients , those are followed up by zeroes. Start Step .
The values are easily checked. Then follows from , , and . Repeating the coefficients follows from the fact that for with or for we have and .
The block of following zeroes is a consequence of the fact that here at least one digit in the base expansion of is .
Similarly one could determine a pattern in the Laurent series expansion for for any prime number characteristic .
4 Fractal structures in for specific golden ratio analogs showing patterns for their series expansions
We start with the definition of operations on matrices that will be frequently used in this section.
Let denote the identity matrix in . For and , let denote the upper left submatrix of .
We introduce the operators
for by setting
and
For finite matrices , is defined equally but if and if .
Note that and .
We set
We define the entry in the th row and th column of the th antidiagonal Matrix
as if and else.
We define the entries of the th alternating antidiagonal matrix as if and else.
4.1 The case of characteristic
We start again with the special case of characteristic . Then we obtain for
Theorem 2.
Let be the matrix determined by and the one determined by in characteristic . We have in both matrices a fractal structure, namely,
and
for with the initial values and .
Proof.
Note that from the definition of , the right blocks in are determined by the left via
The second structure in follows from the one in together with the fact that in characteristic .
In the following we concentrate on and we prove the specific of form
Using we observe
and
Then
and
By induction on we derive that for is the zero matrix except of its upper-left and lower-right submatrices that are antidiagonal matrices. ∎
Remark 6.
Note that the fractal structure in given in the lemma above once again proves
From the fractal structure of one may derive
where .
Similarly, one may derive a formula for the Laurent series expansion of or .
4.2 The case of characteristic
In the last part of this section, we aim for a generalization of the above lemma for odd characteristic and and
Then the special case is given by and .
In the following we search for a pattern in , with and that together with Theorem 1 gives insight to the Laurent series expansion of . The main difficulty is that and do not commute, as
where with denotes the th flattening-operator, that sets all nonzero entries in the first rows in a matrix in equal to zero.
We begin with binomial type theorem for .
Theorem 3.
For every we have
Proof.
We check the formula for . For we use induction on . We observe for three equalities that will help for the proof
Let . Then we use the induction hypothesis for .
It is easily checked that
equals
It remains to rewrite
in the form
Merging the first two sums and adding the result above yields the desired equality.
∎
From Theorem 3 and the Lucas Theorem we derive the following corollary for finite fields.
Corollary 1.
Let be the characteristic of . For we have
Furthermore, for even we have
For odd , we have
From the fact that for any we have , the fact that
where and commute, we might derive a generalization of Corollary 1 above.
Corollary 2.
Set with characteristic . For we have
and for we have
over .
We now exemplary apply the above Corollaries 1 and 2 to the question for a recursive structure in that is a consequence of the specific forms of powers of and that explains the recursive structure of the Laurent series expansion of .
Note that Definition 5 gives us a specific dependence between and (confer also proof of Theorem 2). The binomial type Theorem 3 generalizes the formula for which is given in the proof of Theorem 2.
Example 4 ().
We regard over . Then Figure 2 shows , , and as well as . Those matrices show up the self similar structure in . The first columns of multiplied from the left with give the next columns. The first columns of multiplied from the left with give the last columns of .




Moreover, the self similar structure re-explains the series expansion of over described in Example 3. The values are given in the first row of . The next string of length is the first row of as is the upper left part of . The next string of length is the first row of . The next string of length is then given by the first row of , i.e. , etc.
Example 5 ().
Figure 3 gives the relevant matrices over that give rise to the stepwise series expansion of over .






Hence the starting string of coefficients is , that is followed up by , , and . etc.
Note that from the similar recursive generation of compared to the one of in Definition 5 we may derive a slightly different self similar structure in .
We mentioned already that the Hankel matrices are the generating matrices of the Kronecker type sequences associated with . We would like to remark here that the powers of the so-called Pascal matrices appear as generating matrices of the Faure sequences [3]. Pascal matrices possess nice self similar structures and their entries are defined using binomial coefficients, , while the entries of the matrix are determined by Catalan’s triangular numbers modulo . Figure 4 shows this Pascal matrix versus our matrix for .






5 Discussions
The content of this paper can be viewed as the starting point of various future investigations.
One is the study of the discrepancy of the Kronecker type sequences generated by a Hankel matrix associated with a golden ratio analog . The main question is whether it is growing of optimal order in or not. This study of the discrepancy was the starting point of the investigations in this paper.
A further interesting problem is to generalize at least some of the results in this paper to more general .
We mentioned already that the boundedness of the degrees of the continued fractions coefficients of is linked to regularities of the Hankel matrices, which control the distribution quality of the Kronecker type sequences associated to . An interesting aspect is that the study of the multi-dimensional Kronecker type sequences is therefore linked to the multidimensional Diophantine approximation in the field of power series which is an active area of research (see exemplary [2] and the references therein) . Moreover, sequences which are constructed via the digital method and have excellent distribution properties are also actively studied (see exemplary [4] and the references therein). An exciting aspect is whether similar links can be discovered in the multidimensional situations that might enrich both research fields, the one of multi-dimensional Diophantine approximation in the field of power series and the one of distribution properties of digital sequences.
Acknowledgments
The author is supported by the Austrian Science Fund (FWF), Project F5505-N26, which is a part of the Special Research Program Quasi-Monte Carlo Methods: Theory and Applications.
References
- [1] Bilyk D.: The discrepancy of irrational lattices. Monte Carlo and Quasi-Monte Carlo Methods 2012, Springer Proceedings in Math. and Stat. 65, Springer, 2013.
- [2] Bugeaud, Y. and Zhang, Z.: On homogeneous and inhomogeneous Diophantine approximation over the fields of formal power series. Pacific J. Math. 302 (2019), no. 2, 453–480.
- [3] Faure, H.: Discrépance des suites associées à un système de numération (en dimension s). Acta Arith. 41 (1982), 337–351.
- [4] Hofer, R.: Kronecker-Halton sequences in . Finite Fields Appl. 50 (2018), 154–177.
- [5] Larcher G. and Niederreiter H.: Kronecker-type sequences and nonarchimedean Diophantine approximations of formal Laurent series. Transactions of the American Mathematical Society 347 (1995), no. 6, 2051–2073.
- [6] Larcher G. and Niederreiter H.: Generalized -sequences, Kronecker-type sequences, and Diophantine approximations. Acta Arith. 63 (1993), 379–396.
- [7] Lasjaunias, A.: A survey of Diophantine approximation in fields of power series. Monatsh. Math. 130 (2000), no. 3, 211–229.
- [8] Niederreiter H.: Point sets and sequences with small discrepancy. Monatsh. Math. 104 (1987), 273–337.
- [9] Niederreiter H.: Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, vol.63, SIAM, Philadelphia, 1992.
- [10] Schmidt. W.M.: On continued fractions and Diophantine approximation in power series fields. Acta Arith. 95 (2000), no. 2, 139–166.
- [11] Shallit, J.: Simple continued fractions for some irrational numbers. J. Number Theory 11 (1979), no. 2, 209–217.
- [12] Shallit, J.: Simple continued fractions for some irrational numbers. II. J. Number Theory 14 (1982), no. 2, 228–231.
Authors’ Address:
Roswitha Hofer:
Institute of Financial Mathematics and Applied Number Theory,
University of Linz
Altenbergerstr. 69
A-4040 Linz
Austria
E-mail: [email protected]