Sophie Burrill ; Stephen Melczer ; Marni Mishna - A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape

dmtcs:2530 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2530
A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shapeConference paper

Authors: Sophie Burrill 1; Stephen Melczer ORCID2,3,4; Marni Mishna 1

  • 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

[en]
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.

[fr]
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.


Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Young tableaux, nonnesting partitions, matchings, Baxter permutations, bijections, oscillating tableaux
Funding:
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada

2 Documents citing this article

Consultation statistics

This page has been seen 414 times.
This article's PDF has been downloaded 555 times.