Duplications in the k-generalized Fibonacci sequences
Let k >= 3 be an odd integer. Consider the k-generalized Fibonacci sequence backward. The characteristic polynomial of this sequence has no dominating zero, therefore the application of Baker's method becomes more difficult. In this paper, we investigate the coincidence of the absolute value...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2021
|
| Series: | NEW YORK JOURNAL OF MATHEMATICS
27 |
| Subjects: | |
| Online Access: | http://publicatio.uni-sopron.hu/2206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01725nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | publ2206 | ||
| 005 | 20210805134837.0 | ||
| 008 | 210805s2021 hu o 0|| d | ||
| 022 | |a 1076-9803 | ||
| 024 | 7 | |a 32123661 |2 mtmt | |
| 040 | |a Soproni Egyetem Publicatio Repozitórium |b hun | ||
| 100 | 1 | |a Luca Florian | |
| 245 | 1 | 0 | |a Duplications in the k-generalized Fibonacci sequences |h [elektronikus dokumentum] / |c Florian Luca |
| 260 | |c 2021 | ||
| 300 | |a 1115-1133 | ||
| 490 | 0 | |a NEW YORK JOURNAL OF MATHEMATICS |v 27 | |
| 520 | 3 | |a Let k >= 3 be an odd integer. Consider the k-generalized Fibonacci sequence backward. The characteristic polynomial of this sequence has no dominating zero, therefore the application of Baker's method becomes more difficult. In this paper, we investigate the coincidence of the absolute values of two terms. The principal theorem gives a lower bound for the difference of two terms (in absolute value) if the larger subscript of the two terms is large enough. A corollary of this theorem makes possible to bound the coincidences in the sequence. The proof essentially depends on the structure of the zeros of the characteristic polynomial, and on the application of linear forms in the logarithms of algebraic numbers. Then we reduced the theoretical bound in practice for 3 <= k <= 99, and determined all the coincidences in the corresponding sequences. Finally, we explain certain patterns of pairwise occurrences in each sequence depending on k if k exceeds a suitable entry value associated to the pair. | |
| 650 | 4 | |a matematika- és számítástudományok | |
| 700 | 0 | 1 | |a Pethő Attila |e aut |
| 700 | 0 | 1 | |a Szalay László |e aut |
| 856 | 4 | 0 | |u http://publicatio.uni-sopron.hu/2206/1/27-44v.pdf |z Dokumentum-elérés |