Papers
Topics
Authors
Recent
Search
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 nn. Furthermore, we construct an explicit bijection between this class of tableaux and peakless Motzkin paths of length nn for all n≥1n\ge 1.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.