English
Related papers

Related papers: Matrix Powers of Column-Justified Pascal Triangles…

200 papers

An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…

Combinatorics · Mathematics 2017-10-03 Richard Anstee , Jeffrey Dawson , Linyuan Lu , Attila Sali

We present matrix identities which yield respectively the Jordan canonical form of the Pascal matrix P_n = (i -1 choose j -1)_{1 <= i,j <= n} modulo a prime, the eigenvectors of (i choose j)_{1 <= i,j <= n}, and the Smith normal form of…

Combinatorics · Mathematics 2007-05-23 David Callan

We prove a universal identity for powers of elements in quadratic algebras, expressing x^m in terms of x and the identity. As a consequence, we obtain a general formula for powers of 2x2 matrices depending only on trace and determinant.…

Combinatorics · Mathematics 2026-03-23 Marco Mantovanelli

We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.

Combinatorics · Mathematics 2007-05-23 David Callan

A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…

Rings and Algebras · Mathematics 2007-05-23 Thomas M. Richardson

Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.

Rings and Algebras · Mathematics 2007-05-23 Mario Catalani

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))…

Number Theory · Mathematics 2009-12-20 Zhi-Wei Sun

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…

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

Combinatorics · Mathematics 2019-01-03 James Mc Laughlin , Nancy J. Wyshinski

We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…

General Mathematics · Mathematics 2019-01-28 Kunle Adegoke

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

Number Theory · Mathematics 2015-06-11 Alexandre Laugier , Manjil P. Saikia

In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…

Number Theory · Mathematics 2018-12-31 James Mc Laughlin

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Combinatorics · Mathematics 2023-09-18 Sejin Park , Etienne Phillips , Peikai Qi , Ilir Ziba , Zhan Zhan

In this paper we prove that a matrix property of nettedness (all 2x2 cells satisfy a recurrence) is preserved for powers of such a matrix, where the coefficients are all instances of the same sequence. Also, we find an n-dimensional analog…

Combinatorics · Mathematics 2007-05-23 Pantelimon Stanica

In this paper, we evaluate determinants of some families of Toeplitz-Hessenberg matrices having tribonacci number entries. These determinant formulas may also be expressed equivalently as identities that involve sums of products of…

Combinatorics · Mathematics 2020-03-25 Taras Goy , Mark Shattuck

We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…

Combinatorics · Mathematics 2016-08-02 Aram Tangboonduangjit , Thotsaporn Thanatipanonda

We consider a two-parameter family of triangles whose $(n,k)$-th entry (counting the initial entry as the $(0,0)$-th entry) is the number of tilings of $N$-boards (which are linear arrays of $N$ unit square cells for any nonnegative integer…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen

We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…

Combinatorics · Mathematics 2018-06-28 Ho-Hon Leung

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Combinatorics · Mathematics 2010-07-19 Emrah Kilic , Eugen J. Ionascu

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

Rings and Algebras · Mathematics 2013-02-26 Hamid Usefi