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

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής

Κύριοι συγγραφείς:	Sophie Burrill, Stephen Melczer, Marni Mishna
Μορφή:	Artigo
Γλώσσα:	Inglês
Έκδοση:	Discrete Mathematics & Theoretical Computer Science 2015-01-01
Σειρά:	Discrete Mathematics & Theoretical Computer Science
Θέματα:	young tableaux nonnesting partitions matchings baxter permutations bijections oscillating tableaux [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Διαθέσιμο Online:	https://dmtcs.episciences.org/2530/pdf
Ετικέτες:	Προσθήκη ετικέτας Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!