The linear algebra of the pascal matrix


AbstractPascal's triangle can be represented as a square matrix in two basically different ways: as a lower triangular matrix Pn or as a full, symmetric matrix Qn. It has been found that the Pn PnT is the Cholesky factorization of Qn. Pn can be factorized by special summation matrices. It can be shown that the inverses of these matrices are the operators which perform the Gaussian elimination steps for calculating Cholesky's factorization. By applying linear algebra we produce combinatorial identities and an existence theorem for diophantine equation systems. Finally, an explicit formula for the sum of the kth powers is given

Similar works

Full text


Elsevier - Publisher Connector

Provided a free PDF
Last time updated on 4/28/2017View original full text link

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.