Netted Binomial Matrices

In this study, we apply "r" times the binomial transform to the Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we give the relationships of between iterated binomial transforms for Padovan and Perrin matrix sequences.

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 Binet formula, serves as a triggering factor to provide explicit formulas for the matrix $p$th roots. Special cases and illustrative numerical examples are given.

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These studies have led us to discover a fundamental identity of determinant involving powers of linear polynomials. Finally, we discuss the determinants of matrices whose entries are products of the generalized Fibonacci numbers.

In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also give some identities known in special Jordan Algebras. The matrices play a bridge role between both theories. The mentioned matrices connect both areas of mathematics, special Jordan algebras and recurrence relations, to obtain new identities ...

The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal numbers or the binomial transforms of Hankel matrices. Hankel matrices which are defined by Catalan numbers and related to the paperfolding sequence are interesting objects in number theory. Therefore, matrices that share many properties with t...

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the American Mathematical Monthly). We generalize it for any prime p, and give a beautiful connection to Fibonacci numbers.

In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials, Fermat polynomials, Fermat-Lucas polynomials, and so on.

In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Fibonacci p-polynomials are general form of, for example, bivariate Fibonacci and Pell p-polynomials, second kind Chebyshev polynomials, bivariate Jacobsthal polynomials etc.

In this paper, we obtain a general expression for the entries of the lth (l is integer) powers of even order (2k+1)-diagonal Toeplitz matrices. Additionally, we have the complex factorizations of Fibonacci polynomials.

The purpose of this paper is twofold; (1) to develop several identities for the Generalized $k$-Pell sequence (including those of Binet, Catalan, Cassini, and d'Ocagne), and (2) to study applications of tridiagonal generating matrices for the $k$-Pell and Generalized $k$-Pell sequences.