Abstract: A permutation is said to avoid a given pattern if there is no subsequence of the permutation in the same relative order as that pattern. This notion of pattern avoidance has several applications, including applications to algebraic combinatorics and to dynamical systems. Previously I investigated cyclic permutations that avoid one pattern in its one-line notation and another pattern in its cycle notation. In this talk I will discuss work to calculate statistics on cyclic permutations avoiding two patterns in cycle notation.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: