arXiv Analytics

Sign in

arXiv:1812.10738 [math.CO]AbstractReferencesReviewsResources

Revisiting pattern avoidance and quasisymmetric functions

Jonathan Bloom, Bruce Sagan

Published 2018-12-27Version 1

Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the sum is over all pi in S_n(Pi) and F_{Des pi} is the fundamental quasisymmetric function corresponding to the descent set of pi. Hamaker, Pawlowski, and Sagan introduced Q_n(Pi) and studied its properties, in particular, finding criteria for when this quasisymmetric function is symmetric or even Schur nonnegative for all n >= 0. The purpose of this paper is to continue their investigation answering some of their questions, proving one of their conjectures, as well as considering other natural questions about Q_n(Pi). In particular we look at Pi of small cardinality, superstandard hooks, partial shuffles, Knuth classes, and a stability property.

Related articles: Most relevant | Search more
arXiv:1710.05103 [math.CO] (Published 2017-10-13)
Exact and asymptotic enumeration of cyclic permutations according to descent set
arXiv:1810.11372 [math.CO] (Published 2018-10-26)
Pattern avoidance and quasisymmetric functions
arXiv:0906.2795 [math.CO] (Published 2009-06-15, updated 2012-01-31)
Descent sets of cyclic permutations