A note on linear recursions

AbstractWe consider linear recursions of length two and related gap recursions where the indices may not be consecutive integers. Given a linear recursion of length two, we prove the existence of an explicit linear recursion of length [Formula: see text] with arbitrary distance between indices. Conv...

Full description

Bibliographic Details
Main Authors: Saeree Wananiyakul, Janyarak Tongsomporn
Format: Article
Language:English
Published: Taylor & Francis Group 2023-12-01
Series:Arab Journal of Basic and Applied Sciences
Subjects:
Online Access:https://www.tandfonline.com/doi/10.1080/25765299.2022.2157951
_version_ 1797924307708411904
author Saeree Wananiyakul
Janyarak Tongsomporn
author_facet Saeree Wananiyakul
Janyarak Tongsomporn
author_sort Saeree Wananiyakul
collection DOAJ
description AbstractWe consider linear recursions of length two and related gap recursions where the indices may not be consecutive integers. Given a linear recursion of length two, we prove the existence of an explicit linear recursion of length [Formula: see text] with arbitrary distance between indices. Conversely, it is shown under some mild assumption that a linear recursion of length [Formula: see text] can be reduced to one of length two.
first_indexed 2024-04-10T14:59:30Z
format Article
id doaj.art-15a8e8cedd844e53b2e03e3579a66d5d
institution Directory Open Access Journal
issn 2576-5299
language English
last_indexed 2024-04-10T14:59:30Z
publishDate 2023-12-01
publisher Taylor & Francis Group
record_format Article
series Arab Journal of Basic and Applied Sciences
spelling doaj.art-15a8e8cedd844e53b2e03e3579a66d5d2023-02-15T15:42:58ZengTaylor & Francis GroupArab Journal of Basic and Applied Sciences2576-52992023-12-01301747810.1080/25765299.2022.2157951A note on linear recursionsSaeree Wananiyakul0Janyarak Tongsomporn1Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok, ThailandSchool of Science, Walailak University, Nakhon Si Thammarat, ThailandAbstractWe consider linear recursions of length two and related gap recursions where the indices may not be consecutive integers. Given a linear recursion of length two, we prove the existence of an explicit linear recursion of length [Formula: see text] with arbitrary distance between indices. Conversely, it is shown under some mild assumption that a linear recursion of length [Formula: see text] can be reduced to one of length two.https://www.tandfonline.com/doi/10.1080/25765299.2022.2157951Fibonacci NumberLinear RecursionRecurrence relation
spellingShingle Saeree Wananiyakul
Janyarak Tongsomporn
A note on linear recursions
Arab Journal of Basic and Applied Sciences
Fibonacci Number
Linear Recursion
Recurrence relation
title A note on linear recursions
title_full A note on linear recursions
title_fullStr A note on linear recursions
title_full_unstemmed A note on linear recursions
title_short A note on linear recursions
title_sort note on linear recursions
topic Fibonacci Number
Linear Recursion
Recurrence relation
url https://www.tandfonline.com/doi/10.1080/25765299.2022.2157951
work_keys_str_mv AT saereewananiyakul anoteonlinearrecursions
AT janyaraktongsomporn anoteonlinearrecursions
AT saereewananiyakul noteonlinearrecursions
AT janyaraktongsomporn noteonlinearrecursions