Pattern-avoiding permutations and Dyson Brownian motion

Probability Seminar

Erik Slivken (Paris Diderot)

Thursday, October 4, 2018 -
3:15pm to 4:15pm
Location: 
119 Physics

Let \(S_n\) denote the set of permutations of length \(n\). For a permutation \(\tau \in S_n\) we say \(\tau\) contains a pattern \(\sigma\in S_k\) if there is a subsequence \(i_1

Last updated: 2018/09/20 - 6:17am