The University of Michigan Combinatorics Seminar


Abstract 

The talk will begin with a short survey of some of the main enumerative results in the subject of restricted (or patternavoiding) permutations. Next I will discuss some recent work concerning statistics on restricted permutations, motivated in part by the surprising result of Zeilberger et al. which states that the number of fixed points has the same distribution in 321avoiding permutations as in 132avoiding permutations. I will give two combinatorial proofs of this result, and generalize it to other statistics. Bijections to Dyck paths play an important role in the proofs. Finally I will consider permutations avoiding several patterns simultaneously, as well as generalized patterns (i.e., with the requirement that some elements occur in adjacent positions). Using similar bijections we obtain generating functions enumerating these restricted permutations with respect to several statistics. 