On the three-rowed skew standard Young tableaux

Details On the three-rowed skew standard Young tableaux On the three-rowed skew standard Young tableaux

2010-02-22

arxiv.org/abs/1002.4060v3

Mathematics

Combinatorics

version3, B1 and typos corrected, 7 pages

Scientific paper

Let $\mathcal{T}_3$ 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" $\mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-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 identites.

Affiliated with

Also associated with

No associations

Rating

On the three-rowed skew standard Young tableaux does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the three-rowed skew standard Young tableaux, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the three-rowed skew standard Young tableaux will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373238