Chains of binary paths and shifted tableaux

MaRDI QIDQ6330086zbMATH OpenFDO

Authors K. Manes, I. Tasoulas, A. Sapounakis, P. Tsikouras

Publication date 29 November 2019

Abstract: In this paper, a natural bijection between multichains of binary paths and shifted tableaux is presented, and it is used for the enumeration of the chains with maximum length from a given path $P$ to the maximum path $mathbf{1}_{|P|}$. By mapping chains to shifted tableaux, the main formulas given in a recent paper by the authors for the enumeration of the $P-mathbf{1}_{|P|}$ chains having only small intervals and minimum length are proved, using some new bijections on shifted tableaux.

This page was built for publication: Chains of binary paths and shifted tableaux

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