Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COMBINATORICS
2000

favoriteEmaildiscussreport

96views more COMBINATORICS 2000»

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions

13 years 4 months ago

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions

Download www.univie.ac.at

Lane H. Clark

Real-time Traffic

COMBINATORICS 2000 |

claim paper

Related Content

» Asymptotic Moments for Interference Mitigation in Correlated Fading Channels

» TypeIV DCT DST and MDCT algorithms with reduced numbers of arithmetic operations

» Frame permutation quantization

» Permutations Without Long Decreasing Subsequences and Random Matrices

» Major index for 01fillings of moon polyominoes

» Expanders are universal for the class of all spanning trees

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Lane H. Clark

Comments (0)