# Per Alexandersson:Run-sorting

**Time: **
Wed 2023-02-01 10.15 - 11.15

**Location: **
KTH 3721

**Participating: **
Per Alexandersson (Stockholm University)

Abstract: We talk about the runsorting operation on permutations, which split a permutation into runs of increasing entries, and then rearranges the runs according to their first entry. The result is a 'run-sorted permutation', and this operation has several surprising properties. (Joint with Olivia Nabawanda).