8. february, kl. 11:40, í Oddi O-106
Fyrirlesari: Anders Claesson, Háskóli Íslands.
Titill: Permutations with few inversions
Ágrip: 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.