2000 character limit reached
A bijection between peakless Motzkin paths and LR tableaux
Published 13 Aug 2026 in math.CO | (2608.13401v1)
Abstract: We prove the conjecture of Donnelly et al. that a certain class of Littlewood-Richardson tableaux are equinumerous with peakless Motzkin paths of length . Furthermore, we construct an explicit bijection between this class of tableaux and peakless Motzkin paths of length for all .
Paper Prompts
Sign up for free to create and run prompts on this paper.