Matrix representation for combinatorics

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Review text

Many combinatorial quantities have natural representations in terms of denumerably infinite matrices. For example, the matrix \(B=(B_{ij})\), \(i,j=0,1,2,..\). where \(B_{ij}=\left( \begin{matrix} i\\ j\end{matrix} \right)\) represents the binomial coefficients, and if \(b_ k\) is the k-th Bernoulli number the infinite column vector \(b=(b_ k)\), \(k=0,1,2,..\). represents the Bernoulli numbers. By exploiting this idea together with some algebra of denumerably matrices, the author provides a simplification and unification of some traditional results as well as a method of discovery and proof of combinatorial identities. The key concept to his approach is that of the derivative of a denumerably infinite matrix.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Matrix representation for combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799673)