Hecke groups, linear recurrences, and Kepler limits
Barry Brent

TL;DR
This paper explores the properties of linear fractional transformations in Hecke groups related to the golden ratio and other cosine-based groups, revealing connections with Fibonacci numbers and linear recurrences.
Contribution
It provides explicit formulas for transformations in Hecke groups involving Fibonacci numbers and extends observations to groups generated by cosines of rational multiples of pi.
Findings
Transformations are quotients of linear polynomials in z with coefficients linked to Fibonacci numbers.
Coefficients in these transformations are linear in the golden ratio and Fibonacci multiples.
Observations extend to functions in groups generated by cosines of b5k for k 5 5.
Abstract
We study the linear fractional transformations in the Hecke group where is either root of (the larger root being the "golden ratio" .) Let and let be a generic element of the upper half-plane. Exploiting the fact that , we find that is a quotient of linear polynomials in such that the coefficients of and in the numerator and denominator of appear themselves to be linear polynomials in with coefficients that are certain multiples of Fibonacci numbers. We make somewhat less detailed observations along similar lines about the functions in for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Quasicrystal Structures and Properties · Fractal and DNA sequence analysis
**HECKE GROUPS, LINEAR RECURRENCES, AND KEPLER LIMITS
Barry Brent
Received: , Revised: , Accepted: , Published:
Abstract
We study the linear fractional transformations in the Hecke group where is either root of (the larger root being the “golden ratio” .) Let and let be a generic element of the upper half-plane. Exploiting the fact that , we find that is a quotient of linear polynomials in such that the coefficients of and in the numerator and denominator of appear themselves to be linear polynomials in with coefficients that are certain multiples of Fibonacci numbers. We make somewhat less detailed observations along similar lines about the functions in for greater than or equal to .
1 Introduction
Let be the Hecke group generated by the linear fractional transformations and and let . This article describes numerical experiments carried out to study Hecke groups, mainly for . In this article, an -tuple of symbols
[TABLE]
representing an ordered set of integers is called a *word *on and we write for . A typical element of takes the form
[TABLE]
This representation is not unique. For example, a function in can be described by a word of length for arbitrarily large , because any word representing can be padded with zeros and the resulting word will also represent . Consequently, when studying all represented by words with less than or equal to , we can restrict attention to the words such that is equal to .
Let , represent the larger and smaller roots of , respectively. The problem of expressing (for in terms of the was raised by Leo in [9] and discussed by his student Sherkat in [12]; the first purpose of this article is to write down conjectures addressing this question. Our calculations indicate that, for arbitrary , is a rational function of and in polynomials of -degree less than or equal to . Here are the first few:
[TABLE]
[TABLE]
and
[TABLE]
Following [12], we simplify the above expressions for when is or by repeatedly making the substitution ( or .) The coefficients in become linear polynomials in :
[TABLE]
[TABLE]
and
[TABLE]
[TABLE]
Further calculations suggest that the coefficients of and in these expressions are always linear combinations of first-degree monomials in the such that the numerical coefficient of is times a Fibonacci number determined by the total degree of ; details are in the next section.
It is well known, of course, that the consecutive ratios of Fibonacci numbers converge to . More generally, the limit of the ratios of consecutive elements of a linear recurrence , when it exists, is called by Fiorenza and Vincenzi the *Kepler limit *of . Certain roots of polynomials other than are also Kepler limits [5, 6], so we are led to consider the possibility that the phenomenon generalizes; our observations tend to confirm this guess. Section 2 describes what we found out about , Section 3 describes less detailed observations for with between and (inclusive), and the final section provides some detail about our numerical experiments; documentation in the form of *Mathematica *notebooks is on our ResearchGate site for this article [4].
We state merely empirical claims in this article. We make several conjectures, but they, too, are based on empirical evidence, not on theoretical reasoning. When we say we have observed convergence of a sequence (say) to a limit , we mean that our plots of values of are apparently linear, with negative slope. We rely on our eyesight in this matter: we have not fitted our data to curves with a statistical package. Interested readers are invited to inspect the plots on our ResearchGate pages.
In the following section our observations were made on words in of length , and those in the last section tested words of length . This means that we have in fact tested the claims on all shorter words as well.
In our tests, we identified functions in the with their matrix representations: a function
[TABLE]
was identified with the corresponding matrix product.
More information about the Hecke groups is available, for example, in [2].
Remark 1**.**
The book [7] by Khovanskii apparently describes another method for approximating roots of polynomials using convergent sequences of ratios of elements of numerical sequences; but these sequences are not linear recurrences. (We have not seen [7], but Khovanskii’s’s method is described in [10], where the book is cited.)
2 The group
We make the following definitions.
-
The Fibonacci numbers are defined with the convention that , *etc. *It will be convenient to write as well in contexts where (see below) .
-
is the following Dirichlet character:
[TABLE]
Alternatively, with representing the Kronecker symbol, if or , and otherwise.
-
is the set of words on . The empty word verifies and for any .
-
We write the cardinal number of a set as . We apply the same notation to words in . We write .
-
(a) For , let . If all of the ,
then we write
[TABLE]
We also write .
(b) If and , we write
[TABLE]
(c) Let be as in definition 5a, except that all of the satisfy . Then we write
[TABLE]
We also write .
(d) If and , we write .
- (a) For , the formal product
[TABLE]
We also write
[TABLE]
(b) is the set of all linear combinations with coefficients in the integers of monomials such that .
(c) is the union of the as ranges over .
Remark 2**.**
In view of the identities for or , it is clear that
(i) For each between and (inclusive), there is a function such that and, for all and with positive,
[TABLE]
Referring to the introduction, for example:
[TABLE]
and
[TABLE]
(ii) For each between and (inclusive), there is a function determined by the condition
[TABLE]
The following observations describe the functions represented by words of length less than or equal to in for between and (inclusive.)
Observation 1**.**
(a)
[TABLE]
(b)
[TABLE]
(c)
[TABLE]
(d)
[TABLE]
(e)
[TABLE]
(f)
[TABLE]
(g)
[TABLE]
(h)
[TABLE]
Conjecture 1**.**
Observation 1 holds for words of arbitrary length and all greater than or equal to .
3 Higher-order Hecke groups
Definition: Let be a polynomial and s.t. . If , we say that is *stable *. Whether or not is stable, we associate to it the family of -order linear recurrences with kernel . Let with minimal polynomial (say.) Under certain conditions [5, 6], a root of is the Kepler limit of one of the . The elements of have the form
[TABLE]
(Equation (1) is clear, as in the case, by substitution.)
For pragmatic reasons, we restrict our attention to in the following observations.
Observation 2**.**
For between and (inclusive), if is odd and if is even.
Conjecture 2**.**
For polynomials of the form , the statements in the above observation hold for all greater than or equal to .
Observation 3**.**
Let lie between and (inclusive).
(a) There is a function such that
[TABLE]
with
[TABLE]
and
[TABLE]
for all s.t. .
(b) If is odd, then for some particular and all s.t. :
(b1) and (b2) .
(In our experiments the sum on the right-hand side of Equation (2) typically contains over terms, but twelve or fewer distinct values of .)
(c) Suppose is an even number between and (inclusive.) Then
(c1) clause (b1) still holds, but (b2) does not; in this situation, we found no for which exists. (By design, our searches stop with the first instance of satisfying (a), so this is far from decisive.)
(c2) For , and , the ratios of consecutive elements of the we found in the experiments form two convergent sub-sequences with different limits.
(c3) For , and , the terminate in a sequence in which alternate members are zero, so that the requisite ratios are alternately zero or undefined.
(d) Suppose , or . After a substitution , is transformed to a stable polynomial (say), and then is the Kepler limit of a linear recurrence containing the .
Conjecture 3**.**
In the above observation, clause (a) holds for all greater than or equal to , clause (b) holds for all odd greater than or equal to , and clause (c1) holds for all even greater than or equal to . One of clauses (c2) or (c3) holds for any even . Clause (d) holds for an unbounded set of even greater than or equal to .
The conditions on polynomials under which linear recurrences with Kepler limits that are killed by them were established in [11] (cited in [5]).
A procedure (which can be invoked from computer algebra systems) for computing for one at a time for individual appeared in [2]; some information about the constant terms, in [1]; and, about the degree, in [8].
4 Data on the linear recurrences
4.1 Coefficients
This is a list of distinct coefficents of the appearing in our calculations for Equation (2), ( between and , inclusive):
5: 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657
6: 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441
7: 1, 4, 14, 47, 155, 507, 1652, 5373, 17460, 56714, 184183
8: 1, 2, 8, 28, 96, 328, 1120, 3824, 13056, 44576, 152192, 519616
9: 1, 6, 27, 109, 417, 1548, 5644, 20349, 72846, 259579
10: 1, 5, 25, 100, 375, 1375, 5000, 18125, 65625, 237500, 859375, 3109375
11: 1, 6, 27, 110, 429, 1637, 6172, 23104, 86090, 319792
12: 1, 4, 15, 56, 209, 780, 2911, 10864, 40545, 151316, 564719
13: 1, 6, 27,110, 429, 1638, 6188, 23255, 87190, 326646
14: 1, 7, 49, 245, 1078, 4459, 17836, 69972, 271313, 1044435, 4002467
15: 1, 5, 20, 74, 265, 936, 3290, 11560, 40699, 143755, 509771
16: 1, 2, 16, 88, 416, 1820, 7616, 31008, 124032, 490312
17: 1, 8, 44, 208, 910, 3808, 15504, 62016, 245157
18: 1, 3, 18, 81, 333, 1323, 5184, 20196, 78489, 304722, 1182519
19: 1, 10, 65, 350, 1700, 7752, 33915, 144210
20: 1, 8, 45, 220, 1000, 4352, 18411, 76380, 312455
21: 1, 7, 35, 154, 636, 2534, 9877, 37962, 144571, 547239
22: 1, 11, 121, 847, 4840, 24684, 117249, 531069, 2326588
23: 1, 12, 90, 544, 2907, 14364, 67298
24: 1, 8, 44, 208, 911, 3824, 15656, 63136, 252241
25: 1, 10, 65, 350, 1700, 7752, 33915, 144210
26: 1, 13, 169, 1352, 8619, 48165, 247247, 1197196
27: 1, 18, 189, 1518
28: 1, 12, 91, 560, 3059, 15484, 74382
29: 1, 14, 119, 798, 4655, 24794
30: 1, 7, 35, 155, 650, 2653, 10676, 42635, 169555
31: 1, 16,152, 1120, 7084
32: 1 , 2, 32, 304, 2240, 14168
33: 1, 11, 77, 440, 2244, 10659, 48278, 211486
4.2 Initial segments for observations 3a - 3c
This section describes the results of a search for initial segments of linear recurrences with length equal to that of the kernel of (so that determines ) such that a sufficiently long initial segment of contains the elements listed above for corresponding .
5: {0, 1}
6: {0, 1}
7: {0, 0, 1}
8: {0, 0, 1, 2}
9: {0, 0, 1}
10: {0, 0, 1, 5}
11: {0, 0, 0, 0, 1}
12: {0, 0, 0, 1}
13: {0, 0, 0, 0, 0, 1}
14: { -3, 1, -3, 0, -3, 0 }
15: {0, 0, 0, 1}
16: {0, 0, 0, 0, 0, 0, 1, 2}
17: {0, 0, 0 ,0, 0, 0, 0, 1}
18: {0, 0, 0, 0, 1, 3}
19: {0, 0, 0, 0, 0, 0, 0, 0, 1}
21: {0, 0, 0, 0, 0, 1}
22: {-1, 1, -1, 0, -1, 0, -1, 0, -1, 0}
23: {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
24: {0, 0, 0, 0, 0, 0, 0, 1}
25: {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
26: {-1, -1, -1, 0 , -1, 0, -1, 0, -1, 0, 1, 0}
27: {0, 0, 0, 0, 0, 0, 0, 0, 1}
28: {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
29: {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
30: {0, 0, 0, 0, 0, 0, 0, 1}
31: {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
32: {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2}
33: {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}
4.3 Initial segments for observation 3d
This is a list of initial segments for , and , satisfying the conditions of observation 3d.
12: {0, 1}
14: {1, 0, 0}
20: {0, 0, 1}
22: {1, 0, 0, 0, 0}
24: {0, 0, 0, 1 }
28: {0, 0, 0, 0, 0, 1 }
30: {0, 0, 0, 1}
4.4 Kernels for the linear recurrences
We list these for the convenience of the reader. Below is the list of kernels for the for between and (inclusive.)
5: {1 ,1}
6: {0, 3}
7: {1, 2, -1}
8: {0, 4, 0, -2}
9: {0, 3, 1}
10: {0, 5, 0, -5}
11: {1, 4, -3, -3, 1}
12: {0, 4, 0, -1}
13: {1, 5, -4, -6, 3, 1}
14: {0, 7, 0, -14, 0, 7}
15: {-1, 4, 4, -1}
16: {0, 8, 0, -20, 0, 16, 0, -2}
17: {1, 7, -6, -15, 10, 10, -4, -1}
18: {0, 6, 0, -9, 0, 3}
19: {1, 8, -7, -21, 15, 20, -10, -5, 1}
20: {0, 8, 0, -19, 0, 12, 0, -1}
21: {-1, 6, 6, -8, -8, -1}
22: {0, 11, 0, -44, 0, 77, 0, -55, 0, 11}
23: {1, 10, -9, -36, 28, 56, -35, -35, 15, 6, -1}
24: {0, 8, 0, -20, 0, 16, 0, -1}
25: {0, 10, 0, -35, 1, 50, -5, -25, 5, 1}
26: {0, 13, 0, -65, 0, 156, 0, -182, 0, 91, 0, -13}
27: {0, 9, 0, -27, 0, 30, 0, -9, 1}
28: {0, 12, 0, -53, 0, 104, 0, -86, 0, 24, 0, -1}
29: {1, 13, -12, -66, 55, 165, -120, -210, 126, 126, -56, -28, 7, 1}
30: {0, 7, 0, -14, 0, 8, 0, -1}
31: {1, 14, -13, -78, 66, 220, -165, -330, 210, 252, -126, -84, 28, 8, -1 }
32: {0, 16, 0, -104, 0, 352, 0, -660, 0, 672, 0, -336, 0, 64, 0, -2}
33: {-1, 10, 10, -34, -34, 43, 43, -12, -12, -1}
Below is the list of kernels for the , and , satisfying the conditions of observation 3d.
12: {4, -1}
14: {7, -14, 7}
20: {8, -19, 12, -1}
22: {11, -44, 77, -55, 11}
24: {8, -20, 16, -1}
28: {12, -53, 104, -86, 24, -1}
30: {7, -14, 8, -1}
References
[1] C. Adiga, I. N. Cangul and H. N. Ramaswamy, On the constant term of the minimal polynomial of over , Filomat, 30 (2016), 1097–1102.
[2] A. Bayad and I. N. Cangul, The minimal polynomial of and Dickson polynomials, Appl. Math. Comp., 218 (2012), 7014–7022.
[3] B. C. Berndt and M. I. Knopp, Hecke’s Theory of Modular Forms and Dirichlet Series, World Scientific, Singapore, 2008.
[4] B. Brent, https://www.researchgate.net/profile/
(search under “Barry Brent”, including the quotation marks.)
[5] A. Fiorenza and G. Vincenzi, From Fibonacci sequence to the golden ratio,
http://dx.doi.org/10.1155/2013/204674 J. Math. 2013 (2013)
[6] A. Fiorenza and G. Vincenzi, Limit of ratio of consecutive terms for general order-k linear homogeneous recurrences with constant coefficients, Chaos Solitons Fractals 44 (2011), 145–152.
[7] A. N. Khovanskii, The Application of Continued Fractions and Their Generalizations to Problems in Approximation Theory (tr. P. Wynn), Noordhoff Publishers, Groningen, 1963.
[8] D. H. Lehmer, A note on trigonometric algebraic numbers, Amer. Math. Monthly, 40 (1933), 165-166.
[9] J. G. Leo, Fourier Coefficients of Triangle Functions (Ph. D. thesis),
http://halfaya.org/ucla/research/thesis.pdf, U.C.L.A, Los Angeles, 2008.
[10] J. Mc Laughlin and B. Sury, Some observations on Khovanskii’s matrix methods for extracting roots in polynomials, Integers, 7 (2007), # A48.
[11] H. Poincare, Sur les equations lineaires aux differentielle ordinaires et aux differences finies, Amer. J. Math. (1885) 203–258.
[12] H. Sherkat, Investigation of the Hecke group and its Eisenstein series, (undergraduate thesis) http://halfaya.org/ucla/research/sherkat.pdf, U.C.L.A, Los Angeles, 2007.
