80 citations · 239 across the 59 of their papers we have counts for
75 papers
Partitions with parity restrictions: a bijective approach
William Keith, Bruce E. Sagan
There has been recent interest in integer partitions whose parts satisfy parity restrictions: for example, those where all the odd parts are distinct, or those where all the even p…
Cyclic shuffle-compatibility via cyclic shuffle algebras
Jinting Liang, Bruce E. Sagan, Yan Zhuang
A permutation statistic is said to be shuffle-compatible if the distribution of over the set of shuffles of two disjoint permutations an…
q-Stirling numbers in type B
Bruce E. Sagan, Joshua P. Swanson
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analog…
Rowmotion on fences
Sergi Elizalde, Matthew Plante, Tom Roby +1
A fence is a poset with elements F = {x_1, x_2, ..., x_n} and covers x_1 < x_2 < ... < x_a > x_{a+1} > ... > x_b < x_{b+1} < ... where a, b, ... are positive integers. We investiga…
Consecutive patterns in circular permutations
Sergi Elizalde, Bruce Sagan
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive pattern…
The Amazing Chromatic Polynomial
Bruce E Sagan
Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same co…