# Anders Claesson: Permutations with few inversions

**Time: **
Wed 2023-05-10 10.15 - 11.15

**Location: **
KTH 3721

**Participating: **
Anders Claesson (University of Iceland)

Abstract: We consider permutations of [n] with at most n inversions; this is what we mean by permutation with few inversions. In particular, we present a curious generating function for permutations of [n] with exactly n inversion. Furthermore, we consider permutations that in addition to having few inversions avoid some fixed pattern. We present a simple-sounding conjecture that if proved correct would lead to a new record for the upper bound of the Stanley-Wilf limit of the notoriously difficult pattern 1324.