中文

A bijection between peakless Motzkin paths and LR tableaux

组合数学 2026-08-13 v1

摘要

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 n1n\ge 1.

引用

@article{arxiv.2608.13401,
  title  = {A bijection between peakless Motzkin paths and LR tableaux},
  author = {Milan Tenn},
  journal= {arXiv preprint arXiv:2608.13401},
  year   = {2026}
}

备注

20 pages