Modul:   MAT591  Discrete mathematics

Machines that shuffle badly

Vortrag von Dr. Michael Albert

Sprecher eingeladen von: Prof. Dr. Mathilde Bouvel

Datum: 09.02.16  Zeit: 11.15 - 12.15  Raum: Y27H28

One starting point for the study of permutation patterns was Knuth’s characterisation of the permutations that can be generated by a single pass through a stack. This viewpoint has moved in and out of favour over the nearly forty years since then. I’ll show how it allows one to understand certain coincidences in the enumeration of permutation classes in a uniform way, and also discuss some open (and presumably difficult) problems associated with it.

The talk is entirely self-contained and assumes no previous knowledge of permutation patterns.