Abstract

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. Les séquences de tableau de hauteur bornée sont au centre de l’analyse des partages et couplages. Nous montrons que les familles de séquences qui se terminent par une seule ligne sont particulièrement fascinantes. Tout d’abord, nous prouvons que les tableaux hésitants de hauteur au plus deux se terminant par une seule ligne sont dénombrés par les nombres de Baxter. Cela nous permet de définir trois nouvelles classes Baxter qui, remarquablement, ne possèdent évidemment pas la symétrie antipode des autres classes Baxter connus. Nous discutons le résultat récent qui dit que les tableaux oscillants de hauteur au plus $k$ se terminant dans une ligne sont en bijection avec les tableaux de Young de hauteur au plus 2$k$. Nos preuves sont analytiques, il y a donc des bijections combinatoiresintrigantes à trouver.

Highlights

  • Introduction1365–8050 c 2015 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France

  • The counting sequence for Baxter permutations, whose elements n Bn =k=1 n+1 n+1 n+1 k−1 k k+1 n+1 n+11365–8050 c 2015 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, FranceSophie Burrill and Stephen Melczer and Marni Mishna are known as Baxter numbers, is a fascinating combinatorial entity, enumerating a diverse selection of combinatorial classes and resurfacing in many contexts which do not a priori appear connected

  • We have discovered a bridge between classic Baxter objects and sequences of tableaux, and walks in Weyl chambers

Read more

Summary

Introduction

1365–8050 c 2015 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France. The main focus of this article is tableau sequences that end in a (possibly empty) row shape: as these correspond to a family of lattice walks that end on a boundary, we are able to deduce enumerative results and find surprising connections to other known combinatorial structures. Another consequence of this construction is a new generating tree description for Baxter numbers. Conjecture 4 The set of Wk-oscillating lattice walks of length n ending at the boundary {(m + k, k − 1, .

Tableaux families
Lattice walks
Open arc diagrams
Tableaux to walks
Arc diagrams and tableaux
Baxter permutations
A generating function for hesitating walks ending on an axis
A new generating tree
Standard Young tableaux of bounded height
A determinant approach
A diagonal approach
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call