Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 24 Nov 2014 in math.CO | (1411.6606v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.