Let $S_n(q)$ be the number of permutations of length $n$ avoiding the pattern $ q$. A recent spectacular result of Marcus and Tardos shows that for any pattern $q$, there exists a constant $c_q$ so that $S_n(q)
Tuesday, April 5, 2005 - 12:00pm
University of Florida
Let $S_n(q)$ be the number of permutations of length $n$ avoiding the pattern $ q$. A recent spectacular result of Marcus and Tardos shows that for any pattern $q$, there exists a constant $c_q$ so that $S_n(q)