Jonathan Bloom

activity

20122019

most citedPattern avoidance in matchings and partitions

5 citations · 5 across the 1 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

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…

math.CO2019

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…

math.CO2019

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 $B$ of the symmetric group $\fS_n$ is the quasisymmetr…