The Filbert Matrix
Thomas M. Richardson
Abstract
A Filbert matrix is a matrix whose (i,j) entry is 1/F(i+j-1), where Fn 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 having integer entries. We prove that the matrix formed by replacing the Fibonacci numbers with the Fibonacci polynomials has entries which are integer polynomials. We also prove that certain Hankel matrices of reciprocals of binomial coefficients have integer entries, and we conjecture that the corresponding matrices based on Fibonomial coefficients have integer entries. Our method is to give explicit formulae for the inverses.
Create a lesson
Related papers
Free Novikov-Zinbiel algebra
A. Dauletiyarova, F. Mashurov, B. Sartayev
Very good gradings on structural matrix rings
Patrik Lundström, Johan Öinert, Laura Orozco et al.
Relation graphs of the sedenion algebra
Alexander Guterman, Svetlana Zhilina
On doubly alternative zero divisors in Cayley-Dickson algebras
Svetlana Zhilina
Diameter of the commutativity graph of the real sedenions
Svetlana Zhilina
Functional identities of degree 2 at two-sided zero products on incidence algebras
Hongyu Jia, Zhankui Xiao