Related papers: Fibonacci vector and matrix p-norms
The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…
Let w be a factor of Fibonacci sequence F=x_1x_2..., then it appears in the sequence infinitely many times. Let w_p be the p-th appearance of w and v_{w,p} be the gap between w_p and w_{p+1}. In this paper, we discuss the structure of the…
We give enumerations of various families of restricted permutations involving the Fibonacci numbers or k-generalized Fibonacci numbers.
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
This study is devoted to the polynomial representation of the matrix $p$th root functions. The Fibonacci-H\"orner decomposition of the matrix powers and some techniques arisen from properties of generalized Fibonacci sequences, notably the…
We study directions along which the norms of vectors are preserved under a linear map. In particular, we find families of matrices for which these directions are determined by integer vectors. We consider the two-dimensional case in detail,…
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…
We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix…
A real vector space combined with an inverse for vectors is sufficient to define a vector continued fraction whose parameters consist of vector shifts and changes of scale. The choice of sign for different components of the vector inverse…
In this paper, we study a structured family of matrices whose entries are given by products of $k$-Fibonacci and $k$-Lucas numbers. For this family, we obtain explicit and unified formulas for several classical matrix invariants, including…
We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.
In this paper we use well-known results from linear algebra as tools to explore some properties of products of Fibonacci numbers. Specifically, we explore the behavior of the eigenvalues, eigenvectors, characteristic polynomials,…
This paper considers the properties of Tribonacci numbers on identities, matrices, and determinants. In the first front part, we obtain several symmetric identities of Tribonacci numbers by a matrix-based approach and binomial inversion…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
We show that there are no non-trivial linear dependencies among p-norms of vectors in finite dimensions that hold for all p. The proof is by complex analytic continuation.
Deciding whether a model provides a good description of data is often based on a goodness-of-fit criterion summarized by a p-value. Although there is considerable confusion concerning the meaning of p-values, leading to their misuse, they…
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 consider the sequence whose n^{th} term is the number of h-vectors of length n. We show that the n^{th} term of this sequence is bounded above by the n^{th} Fibonacci number and bounded below by the number if integer…