A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape

MaRDI QIDQ2803307zbMATHFDO

Authors Sophie Burrill, Stephen Melczer, Marni Mishna

Publication date 4 May 2016

Full work available at URL https://arxiv.org/abs/1411.6606

zbMATH Keywords

Young tableauxmatchingsbijectionsoscillating tableauxBaxter permutationsnonnesting partitions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Abstract: 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 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. We then conjecture that oscillating tableau of height bounded by k ending in a row are in bijection with Young tableaux of bounded height 2k. We prove this conjecture for k at most eight by a generating function analysis. Many of our proofs are analytic in nature, so there are intriguing combinatorial bijections to be found.

Recommendations

• Tableau sequences, open diagrams, and Baxter families
• Bijections for Baxter families and related objects
• scientific article; zbMATH DE number 7640030
• ROW CONVEX TABLEAUX AND BOTT–SAMELSON VARIETIES
• Row-convex tableaux and the combinatorics of initial terms
• A bijection between Littlewood-Richardson tableaux and rigged configurations
• Bijections for permutation tableaux
• Bijections for permutation tableaux
• Some bijective correspondences involving domino tableaux
• A bijection between certain non-crossing partitions and sequences

Cited in

(6)

• Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods
• Tableau sequences, open diagrams, and Baxter families
• Determinant formulas relating to tableaux of bounded height
• On some combinatorial sequences associated to invariant theory
• Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
• A generating tree approach to \(k\)-nonnesting partitions and permutations

This page was built for publication: A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803307)