Hans Hongesberg: Pattern avoidance in alternating sign rectangles

Pattern avoidance in alternating sign rectangles Hans Hongesberg

Abstract: Pattern avoidance in permutations is an active research area of enumerative combinatorics, with early motivations from theoretical computer science. Although alternating sign matrices are a well-known generalisation of permutation matrices, comparatively little research has been done on pattern avoidance in alternating sign matrices, aside from a few notable exceptions. In this talk, we explore several notions of pattern avoidance in alternating sign matrices and alternating sign rectangles, and present enumerative, asymptotic, and explicit bijective results. This is joint work with Matjaž Konvalinka and Svante Linusson.