Authors: Sophie Burrill ¹; Stephen Melczer ^2,3,4; Marni Mishna ¹

• 1 Department of Mathematics [Burnaby]
• 2 David R. Cheriton School of Computer Science
• 3 Laboratoire de l'Informatique du Parallélisme
• 4 Arithmetic and Computing

Tableau sequences of bounded height have been central to the analysis of $k$-noncrossing set partitions and matchings. We show here that families of sequences that end with a row shape are particularly compelling and lead to some interesting connections. First, we prove that hesitating tableaux of height at most two ending with a row shape are counted by Baxter numbers. This permits us to define three new Baxter classes which, remarkably, do not obviously possess the antipodal symmetry of other known Baxter classes. Oscillating tableau of height bounded by $k$ ending in a row are in bijection with Young tableaux of bounded height 2$k$. We discuss this recent result, and somegenerating function implications. Many of our proofs are analytic in nature, so there are intriguing combinatorial bijections to be found.