5 citations · 5 across the 1 of their papers we have counts for
5 papers
On cyclic Schur-positive sets of permutation
Jonathan Bloom, Sergi Elizalde, Yuval Roichman
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of…
Counting pattern-avoiding integer partitions
Jonathan Bloom, Nathan McNew
A partition is said to contain another partition (or pattern) if the Ferrers board for is attainable from under removal of rows and columns. We say avoids i…
Symmetric multisets of permutations
Jonathan Bloom
The following long-standing problem in combinatorics was first posed in 1993 by Gessel and Reutenauer. For which multisubsets of the symmetric group $\fS_n$ is the quasisymmetr…
Revisiting pattern avoidance and quasisymmetric functions
Jonathan Bloom, Bruce Sagan
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 th…
Pattern avoidance in matchings and partitions
Jonathan Bloom, Sergi Elizalde
Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These…