A Relation for Domino Robinson-Schensted Algorithms

Details A Relation for Domino Robinson-Schensted Algorithms A Relation for Domino Robinson-Schensted Algorithms

2006-03-28

arxiv.org/abs/math/0603654v3

Mathematics

Combinatorics

13 pages; Expanded introduction and minor corrections

Scientific paper

We describe a relationship between Robinson-Schensted algorithms defined for
standard domino tableaux of unequal rank. The principal idea is the
moving-through operation defined on standard domino tableaux by D. Garfinkle.
When restricted to involutions, this answers a question posed by M.A.A. van
Leeuwen.

Affiliated with

Also associated with

No associations

Rating

A Relation for Domino Robinson-Schensted Algorithms 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 A Relation for Domino Robinson-Schensted Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Relation for Domino Robinson-Schensted Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463609