English

Standard Young Tableaux and Colored Motzkin Paths

Combinatorics 2013-02-14 v1

Abstract

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the nn-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length nn. This result not only gives a lattice path interpretation of the standard Young tableaux but also reveals an unexpected intrinsic relation between the set of SYTs with at most 2d+12d+1 rows and the set of SYTs with at most 2d rows.

Keywords

Cite

@article{arxiv.1302.3012,
  title  = {Standard Young Tableaux and Colored Motzkin Paths},
  author = {Sen-Peng Eu and Tung-Shan Fu and Justin T. Hou and Te-Wei Hsu},
  journal= {arXiv preprint arXiv:1302.3012},
  year   = {2013}
}

Comments

21 pages

R2 v1 2026-06-21T23:25:16.082Z