Permutations with Few Inversions

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

doi:10.37236/12075

Anders Claesson
Atli Fannar Franklín
Einar Steingrímsson

DOI: https://doi.org/10.37236/12075

Abstract

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.