Convolved Numbers of $k$-sections of the Fibonacci Sequence: Properties, Consequences
Vitaly M. Khamitov, Dmitriy Dmitrishin, Alexander Stokolos, Daniel Gray

TL;DR
This paper introduces a new generalization of Fibonacci numbers through convolutions of k-sections, providing explicit formulas and exploring their properties and connections to Chebyshev polynomials and Lucas numbers.
Contribution
It defines convolutions of k-sections of Fibonacci numbers, derives explicit formulas, and explores their mathematical properties and connections to other special functions.
Findings
Derived an explicit formula for convolutions of k-sections of Fibonacci numbers.
Established a Binet type formula for these convolutions.
Connected these sequences to derivatives of Chebyshev polynomials and Lucas numbers.
Abstract
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences such as the Fibonacci sequence and its generalizations) are additionally used. Two such generalizations are convolved Fibonacci numbers and k-sections of the Fibonacci sequence This article considers a further generalization of Fibonacci numbers, namely convolutions of k-sections of the Fibonacci sequence . These numbers are defined by the relations: Moreover, $\Phi_{n,1}=F_n,…
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 · Coding theory and cryptography · Chaos-based Image/Signal Encryption
