Zobrazeno 1 - 10
of 80
pro vyhledávání: '"BUNDER, MARTIN"'
Autor:
Bunder, Martin, Tonien, Joseph
In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of explicit formu
Externí odkaz:
http://arxiv.org/abs/2304.02871
Autor:
Bunder, Martin, Tonien, Joseph
Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with initial val
Externí odkaz:
http://arxiv.org/abs/2106.15790
Publikováno v:
Bulletin of the Australian Mathematical Society; Oct2024, Vol. 110 Issue 2, p189-198, 10p
Autor:
Bunder, Martin
Publikováno v:
The Bulletin of Symbolic Logic, 2019 Dec 01. 25(4), 479-480.
Externí odkaz:
https://www.jstor.org/stable/26875668
Publikováno v:
In Journal of Information Security and Applications June 2018 40:193-198
Autor:
BUNDER, MARTIN, TONIEN, JOSEPH
Publikováno v:
The Mathematical Gazette, 2017 Nov 01. 101(552), 439-448.
Externí odkaz:
https://www.jstor.org/stable/26538923
Publikováno v:
In Theoretical Computer Science 15 December 2017 704:74-81
Autor:
Bunder, Martin, Dekkers, Wil
Publikováno v:
The Journal of Symbolic Logic, 2001 Dec 01. 66(4), 1561-1580.
Externí odkaz:
https://www.jstor.org/stable/2694962
Publikováno v:
The Journal of Symbolic Logic, 1998 Sep 01. 63(3), 869-890.
Externí odkaz:
https://www.jstor.org/stable/2586717