Related papers: Generalizing the Wythoff Array and other Fibonacci…
Expansions in the Golden ratio base have been studied since a pioneering paper of R\'enyi more than sixty years ago. We introduce closely related expansions of a new type, based on the Fibonacci sequence, and we show that in some sense they…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
The first part of this paper completes the classification of Whitney towers in the 4-ball that was started in three related papers. We provide an algebraic framework allowing the computations of the graded groups associated to geometric…
It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
In 2017, Clark Kimberling defined an interesting sequence ${\bf B} = 0100101100 \cdots$ of $0$'s and $1$'s by certain inflation rules, and he made a number of conjectures about this sequence and some related ones. In this note we prove his…
In a recent talk of Robbert Fokkink, some conjectures related to the infinite Tribonacci word were stated by the speaker and the audience. In this note we show how to prove (or disprove) the claims easily in a "purely mechanical" fashion,…
By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…
We study the extended Frobenius problem for sequences of the form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is the Fibonacci sequence and $f_a$ is a Fibonacci number. As a consequence, we show that the family of…
We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…
We modify Wythoff's game by allowing an additional move, which we call a "split", and show how the $P$-positions are coded by the Tribonacci word. We analyze the table of letter positions of arbitrary $k$-bonacci words and find a…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
The Tribonacci sequence is a well-known example of third order recurrence sequence, which belongs to a particular class of recursive sequences. In this article, other generalized Tribonacci sequence is introduced and defined by…
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider some basic operations on…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…
We use generalised Zeckendorf representations of natural numbers to investigate mixing properties of symbolic dynamical systems. The systems we consider consist of bi-infinite sequences associated with so-called random substitutions. We…