Related papers: A Note On the Bounds for the Generalized Fibonacci…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
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…
In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…
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…
Confidence sequences are confidence intervals that can be sequentially tracked, and are valid at arbitrary data-dependent stopping times. This paper presents confidence sequences for a univariate mean of an unknown distribution with a known…
The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…
We study the p-rationality of real quadratic fields in terms of generalized Fibonacci numbers and their periods modulo positive integers.
Recently, a generalized Bernoulli process (GBP) was developed as a stationary binary sequence whose covariance function obeys a power law. In this paper, we further develop generalized Bernoulli processes, reveal their asymptotic behaviors,…
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
Data hiding is the art of embedding data into digital media in a way such that the existence of data remains concealed from everyone except the intended recipient. In this paper, we discuss the various Least Significant Bit (LSB) data…
We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the…
The golden ratio and Fibonacci numbers are found to occur in various aspects of nature. We discuss the occurrence of this ratio in an interesting physical problem concerning center of masses in two dimensions. The result is shown to be…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…
We develop the theory and practical implementation of p-adic sparse coding of data. Rather than the standard, sparsifying criterion that uses the $L_0$ pseudo-norm, we use the p-adic norm. We require that the hierarchy or tree be…
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…