80 citations · 239 across the 59 of their papers we have counts for
6 papers · 1 filter
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…
Cyclic Pattern Containment and Avoidance
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of…
Cyclic Shuffle Compatibility
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of tw…
Pinnacle Set Properties
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i…