Given a set of permutations Pi, let S_n(Pi) denote the set of permutations in the symmetric group S_n that avoid every element of Pi in the sense of pattern avoidance. Given a subset S of {1,...,n-1}, let F_S be the fundamental quasisymmetric function indexed by S. Our object of study is the generating function Q_n(Pi) = sum F_{Des sigma} where the sum is over all sigma in S_n(Pi) and Des sigma is the descent set of sigma. We characterize those Pi contained in S_3 such that Q_n(Pi) is symmetric or Schur nonnegative for all n. In the process, we show how each of the resulting Pi can be obtained from a theorem or conjecture involving more general sets of patterns. In particular, we prove results concerning symmetries, shuffles, and Knuth classes, as well as pointing out a relationship with the arc permutations of Elizalde and Roichman. Various conjectures and questions are mentioned throughout.
Download