An asymptotic expansion for the number of permutations with a certain number of inversions
From MaRDI portal
Publication:1583621
zbMath0969.05005MaRDI QIDQ1583621
Publication date: 30 November 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121225
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic enumeration (05A16)
Related Items (2)
On the connected components of a random permutation graph with a given number of edges ⋮ A CAT algorithm for generating permutations with a fixed number of inversions
This page was built for publication: An asymptotic expansion for the number of permutations with a certain number of inversions