In this paper, the author develops a general formnla for numbers which are extensions of the Eulerian numbers. A~'n, r) is defined to be the number of n-permutations with r rises of magnitude at least m. Intermediate steps in the derivation include a vertical recurrence ~elation. recurrence relation
โฆ LIBER โฆ
Eulerian numbers, tableaux, and the Betti numbers of a toric variety
โ Scribed by John R. Stembridge
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 864 KB
- Volume
- 99
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Recurrences and formulae in an extension
โ
David Magagnosc
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 114 KB
The VAN DER POL Numbers and a Related Se
โ
F. T. Howard
๐
Article
๐
1969
๐
John Wiley and Sons
๐
English
โ 384 KB
On the numbers of spanning trees and Eul
โ
Xueliang Li; Fuji Zhang
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 756 KB
A probabilistic proof of a formula for t
โ
Curtis Greene; Albert Nijenhuis; Herbert S Wilf
๐
Article
๐
1979
๐
Elsevier Science
๐
English
โ 241 KB
What is the smallest number of dicycles
โ
Nathaniel Dean
๐
Article
๐
1986
๐
John Wiley and Sons
๐
English
โ 408 KB
A digraph D with n vertices is said to be decomposable into a set S of dicycles if every arc of D is contained in exactly one member of S. Counterexamples are given to the following conjectures which are generalizations of three well-known conjectures by G. Hajos, P. Erdos, and P. J. Kelly: (1) [B.
On the Mordell-Weil rank of an abelian v
โ
Takeshi Ooe; Jaap Top
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 288 KB