arXiv (All)
open access
On random Binomial-Fibonacci sequences
Motivated by the pioneer work of Viswanath \cite{VIS2000} on random Fibonacci sequences and the development of random Euclidean addition chains in cryptography, we introduce a new family of random Binomial-Fibonacci sequences. We study the asymptotic behavior of their finite-time Lyapunov exponents.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- encrypted media 1#160976
- Theoretically-sound real-world cryptography#20840
- Logarithmic returns of top 100 cryptos (2015-2022)#205106
- On strong law of large numbers for non identically distributed random variables#925047
- On strong law of large numbers for non identically distributed random variables#920813
Record · ID 1132221
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive