Penn Arts & Sciences Logo

Probability and Combinatorics

Tuesday, April 5, 2005 - 12:00pm

Mikos Bona

University of Florida

Location

University of Pennsylvania

3C6 DRLB

Note special time (and place) due to Rademacher lectures

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)