Generalized general-term formulas for $k$-th order linear recurrence relations
European Journal of Mathematics and Applications · 02.10.2026 · 6 · 12
DOI: 10.28919/ejma.2026.6.12 ↗Kurz gefasst
Fachartikel in der Zeitschrift European Journal of Mathematics and Applications, online erschienen am 02.10.2026. Verfasst von K. L. Verma. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
This paper investigates the $k$-th order generalized linear recurrence relation $V_n = \sum_{j=1}^{k} p_j V_{n-j}$, where $p_k \neq 0$ and the coefficients $p_j$ and initial values $V_j = a_j$ are arbitrary integers. By constructing a generalized generating function, we derive a closed-form explicit formula that establishes a unifying framework, generalizing several existing results in the literature. We demonstrate that specializing the order $k$, the initial conditions, and the recurrence coefficients naturally reduces our formulation to classical sequences, such as the Fibonacci, Tribonacci, and Tetranacci sequences. Furthermore, by framing these higher-order sequences through a $k \times k$ state-transition matrix $M$, we extend this theoretical groundwork to demonstrate its utility in advanced applied domains, including cryptography, cyber security, and network vulnerability modeling.
Zitieren
APA
Verma, K. L. (2026). Generalized general-term formulas for $k$-th order linear recurrence relations. European Journal of Mathematics and Applications, 6, 12. https://doi.org/10.28919/ejma.2026.6.12
Vancouver
Verma KL. Generalized general-term formulas for $k$-th order linear recurrence relations. European Journal of Mathematics and Applications. 2026;6:12. doi:10.28919/ejma.2026.6.12
BibTeX
@article{Verma2026,
author = {Verma, K. L.},
title = {Generalized general-term formulas for $k$-th order linear recurrence relations},
journal = {European Journal of Mathematics and Applications},
year = {2026},
volume = {6},
pages = {12},
doi = {10.28919/ejma.2026.6.12}
}
EUVIMED