Matrix representation for combinatorics (Q799673): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(84)90037-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005208814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive matrices and umbral calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4769056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4093447 / rank | |||
Normal rank |
Latest revision as of 14:40, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrix representation for combinatorics |
scientific article |
Statements
Matrix representation for combinatorics (English)
0 references
1984
0 references
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.
0 references
representation of combinatorial quantities
0 references
denumerably infinite matrices
0 references
derivative
0 references