Chains of binary paths and shifted tableaux

2019/11/29 by Manes, K., Tasoulas, I., Sapounakis, A. +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1911.13013

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 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 - 1_|P| chains having only small intervals and minimum length are proved, using some new bijections on shifted tableaux.

Related

• Chains with Small Intervals in the Lattice of Binary Paths
• Note on islands in path-length sequences of binary trees
• About maximal antichains in a product of two chains:A catch-all note
• A simple bijection between permutation tableaux and permutations
• On the imbalance lattice of path-length sequences of binary trees