12 citations · 27 across the 5 of their papers we have counts for
5 papers · 1 filter
Tableau sequences, open diagrams, and Baxter families
Sophie Burrill, Julien Courtiel, Eric Fusy +2
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams.…
A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape
Sophie Burrill, Stephen Melczer, Marni Mishna
Tableau sequences of bounded height have been central to the analysis of k-noncrossing set partitions and matchings. We show here that familes of sequences that end with a row shap…
Constructing Skolem sequences via generating trees
Sophie Burrill, Lily Yen
A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the proble…
A generating tree approach to k-nonnesting partitions and permutations
Sophie Burrill, Sergi Elizalde, Marni Mishna +1
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using th…
On k-crossings and k-nestings of permutations
Sophie Burrill, Marni Mishna, Jacob Post
We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution. As a corollary…