Two applications of general theorems in combinatory analysis: (1) To the theory of inversions of permutations; (2) To the ascertainment of the numbers of terms in the development of a determinant which has amongst its elements an arbitrary number of zero. (Q1469836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2609770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two applications of general theorems in combinatory analysis: (1) To the theory of inversions of permutations; (2) To the ascertainment of the numbers of terms in the development of a determinant which has amongst its elements an arbitrary number of zero. |
scientific article; zbMATH DE number 2609770 |
Statements
Two applications of general theorems in combinatory analysis: (1) To the theory of inversions of permutations; (2) To the ascertainment of the numbers of terms in the development of a determinant which has amongst its elements an arbitrary number of zero. (English)
0 references
1916
0 references
Siehe F. d. M. 44, 76 (JFM 44.0076.*), 1913. Der Verf. wendet die dort aufgestellte und entwickelte Begriffsbildung auf die beiden obigen Fragen an. So ist z. B. die Anzahl der Glieder der Determinante \(| a_1b_2c_3\dots n_n| \) gleich dem Koeffizient von \(x_1x_2\dots x_n\) in der Reihenentwicklung von: \[ \frac{1}{| (1-a_1x_1)(1-b_2x_2)\cdots(1-n_nx_n)| }, \] falls für alle von Null verschiedenen Größen \(a, b, c, \dots\) die Zahl 1 gesetzt wird.
0 references
