Standard Young tableaux and colored Motzkin paths

Sen Peng Eu, Tung Shan Fu, Justin T. Hou, Te Wei Hsu

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. 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 2. d+. 1 rows and the set of SYTs with at most 2. d rows.

Original languageEnglish
Pages (from-to)1786-1803
Number of pages18
JournalJournal of Combinatorial Theory. Series A
Volume120
Issue number7
DOIs
Publication statusPublished - 2013 Sep 1

Fingerprint

Motzkin Paths
Young Tableaux
Lattice Paths
Bijection
Cell
Standards

Keywords

  • Bijection
  • Colored Motzkin paths
  • Shuffles of parenthesis systems
  • Standard Young tableaux

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Standard Young tableaux and colored Motzkin paths. / Eu, Sen Peng; Fu, Tung Shan; Hou, Justin T.; Hsu, Te Wei.

In: Journal of Combinatorial Theory. Series A, Vol. 120, No. 7, 01.09.2013, p. 1786-1803.

Research output: Contribution to journalArticle

Eu, Sen Peng ; Fu, Tung Shan ; Hou, Justin T. ; Hsu, Te Wei. / Standard Young tableaux and colored Motzkin paths. In: Journal of Combinatorial Theory. Series A. 2013 ; Vol. 120, No. 7. pp. 1786-1803.
@article{9add3fdc5d384248a2209da72784bb4e,
title = "Standard Young tableaux and colored Motzkin paths",
abstract = "In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. 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 2. d+. 1 rows and the set of SYTs with at most 2. d rows.",
keywords = "Bijection, Colored Motzkin paths, Shuffles of parenthesis systems, Standard Young tableaux",
author = "Eu, {Sen Peng} and Fu, {Tung Shan} and Hou, {Justin T.} and Hsu, {Te Wei}",
year = "2013",
month = "9",
day = "1",
doi = "10.1016/j.jcta.2013.06.007",
language = "English",
volume = "120",
pages = "1786--1803",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "7",

}

TY - JOUR

T1 - Standard Young tableaux and colored Motzkin paths

AU - Eu, Sen Peng

AU - Fu, Tung Shan

AU - Hou, Justin T.

AU - Hsu, Te Wei

PY - 2013/9/1

Y1 - 2013/9/1

N2 - In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. 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 2. d+. 1 rows and the set of SYTs with at most 2. d rows.

AB - In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. 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 2. d+. 1 rows and the set of SYTs with at most 2. d rows.

KW - Bijection

KW - Colored Motzkin paths

KW - Shuffles of parenthesis systems

KW - Standard Young tableaux

UR - http://www.scopus.com/inward/record.url?scp=84880164893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880164893&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2013.06.007

DO - 10.1016/j.jcta.2013.06.007

M3 - Article

AN - SCOPUS:84880164893

VL - 120

SP - 1786

EP - 1803

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 7

ER -