26 citations · 50 across the 12 of their papers we have counts for
15 papers
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović
Jonathan S. Bloom, Dan Saracino
We prove a conjecture of Guo and Poznanović concerning chains in certain 01-fillings of moon polyominoes. A key ingredient of our proof is a correspondence between words and pa…
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…
Rook and Wilf equivalence of integer partitions
Jonathan Bloom, Dan Saracino
The subjects of rook equivalence and Wilf equivalence have both attracted considerable attention over the last half-century. In this paper we introduce a new notion of Wilf equival…