| Abstract: This is a (Not so introductory) introduction to the problem of pattern avoiding permutations. The general problem is, given a shorter pattern σ ∈ Sk, to find the number of permutations in Sn that avoids the pattern σ. In this talk, we will discuss known exact enumeration results and two recently proved conjectures, the Wilf-Stanley and Furedi-Hajnal conjectures, that gives asymptotic bounds. |