Skew-standard tableaux with three rows

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Let T3 be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with n-3 entries in the "skew three-rowed strip" T3/(2,1,0) is mn-1-mn-3, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilberger's question affirmatively that there is a uniform way to construct bijective proofs for all of those identities.

Original languageEnglish
Pages (from-to)463-469
Number of pages7
JournalAdvances in Applied Mathematics
Volume45
Issue number4
DOIs
Publication statusPublished - 2010 Oct 1

Fingerprint

Motzkin numbers
Young Tableaux
Tableaux
Bijection
Skew
Strip
Motzkin Paths
Bijective
Linear Combination
Coefficient
Standards

Keywords

  • Motzkin numbers
  • Motzkin paths
  • Standard Young tableaux

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Skew-standard tableaux with three rows. / Eu, Sen-Peng.

In: Advances in Applied Mathematics, Vol. 45, No. 4, 01.10.2010, p. 463-469.

Research output: Contribution to journalArticle

@article{0986ed0504a949c9bc7853445e19d7fd,
title = "Skew-standard tableaux with three rows",
abstract = "Let T3 be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with n-3 entries in the {"}skew three-rowed strip{"} T3/(2,1,0) is mn-1-mn-3, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilberger's question affirmatively that there is a uniform way to construct bijective proofs for all of those identities.",
keywords = "Motzkin numbers, Motzkin paths, Standard Young tableaux",
author = "Sen-Peng Eu",
year = "2010",
month = "10",
day = "1",
doi = "10.1016/j.aam.2010.03.004",
language = "English",
volume = "45",
pages = "463--469",
journal = "Advances in Applied Mathematics",
issn = "0196-8858",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - Skew-standard tableaux with three rows

AU - Eu, Sen-Peng

PY - 2010/10/1

Y1 - 2010/10/1

N2 - Let T3 be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with n-3 entries in the "skew three-rowed strip" T3/(2,1,0) is mn-1-mn-3, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilberger's question affirmatively that there is a uniform way to construct bijective proofs for all of those identities.

AB - Let T3 be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with n-3 entries in the "skew three-rowed strip" T3/(2,1,0) is mn-1-mn-3, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilberger's question affirmatively that there is a uniform way to construct bijective proofs for all of those identities.

KW - Motzkin numbers

KW - Motzkin paths

KW - Standard Young tableaux

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

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

U2 - 10.1016/j.aam.2010.03.004

DO - 10.1016/j.aam.2010.03.004

M3 - Article

VL - 45

SP - 463

EP - 469

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

SN - 0196-8858

IS - 4

ER -