arXiv Analytics

Sign in

arXiv:2305.09457 [math.CO]AbstractReferencesReviewsResources

Permutations with few inversions

Anders Claesson, Atli Fannar Franklín, Einar Steingrímsson

Published 2023-05-16Version 1

A curious generating function $S_0(x)$ for permutations of $[n]$ with exactly $n$ inversions is presented. Moreover, $(xC(x))^iS_0(x)$ is shown to be the generating function for permutations of $[n]$ with exactly $n-i$ inversions, where $C(x)$ is the generating function for the Catalan numbers.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1002.2054 [math.CO] (Published 2010-02-10)
The number of permutations with k inversions
arXiv:0805.1325 [math.CO] (Published 2008-05-09)
Classification of bijections between 321- and 132-avoiding permutations
arXiv:1712.10122 [math.CO] (Published 2017-12-29)
The number of inversions of permutations with fixed shape