Slow recurrences

DOI10.1016/J.JNT.2020.05.011MaRDI QIDQ2004951zbMATH OpenOpenAlexFDO

Authors Sam Spiro

Publication date 7 October 2020

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.06517

zbMATH Keywords

recurrenceFibonacci\((\alpha,\beta)\)-walk

Mathematics Subject Classification ID

Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: For positive integers $alpha$ and $$, we define an $$-walk to be any sequence of positive integers satisfying $$. We say that an $$-walk is $n$-slow if $w_s=n$ with $s$ as large as possible. Slow $(1,1)$-walks have been investigated by several authors. In this paper we consider $$-walks for arbitrary positive $$. We derive a characterization theorem for these walks, and with this we prove several results concerning the total number of $n$-slow walks for a given $n$. In addition to this, we study the slowest $n$-slow walk for a given $n$ amongst all possible $$.

Recommendations

• Slow Fibonacci walks
• A restricted random walk defined via a Fibonacci process
• Automatic walks
• scientific article; zbMATH DE number 4214110
• Walks reaching a line

Cites work

• scientific article; zbMATH DE number 4214110 (Why is no real title available?)
• scientific article; zbMATH DE number 1336418 (Why is no real title available?)
• scientific article; zbMATH DE number 1471863 (Why is no real title available?)
• Introduction to algorithms.

Cited in

(2)

• Slow consistency
• Slow Fibonacci walks

This page was built for publication: Slow recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004951)