On the average growth rate of random compositions of fibonacci and padovan recurrences

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An integer sequence {t n } defined by the random recurrence t 0=0 t 1=1, t 2=1, t n+1=t n-ξ +t n-1-ξ , n ≥ 2, where the random variable ξ is equal to 0 or 1 with the probabilities p and q respectively, is called a random composition of Fibonacci and Padovan recurrences. We show that lim n→∞ n√E(tn)is equal to the greatest absolute value of the roots of the algebraic equation λ 3=p λ 2+λ+q. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gogin, N., & Mylläri, A. (2009). On the average growth rate of random compositions of fibonacci and padovan recurrences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5743 LNCS, pp. 240–246). https://doi.org/10.1007/978-3-642-04103-7_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free