1990
DOI: 10.1016/0097-3165(90)90066-6
|View full text |Cite
|
Sign up to set email alerts
|

Robinson-schensted algorithms for skew tableaux

Abstract: We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These correspondences provide combinatorial proofs of various identities involving f&,, the number of standard skew tableaux of shape L/p, and the skew Schur functions So..,,. For example, we are able to show bijectively that and 4 S;&)QdY)=C ~p;p(x)~~,p(Y) n (1-%Y,)Y. P 1. I It is then shown that these new algorithms enjoy some of the same properties as the original. In particular, it is still true that replacing a permu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
107
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(107 citation statements)
references
References 15 publications
0
107
0
Order By: Relevance
“…The technique is to apply the jeu de taquin [6,8,13,14,18] to the primed entries k of P ST taken in turn starting with any 1 s (actually there are none), then any 2 s (at most one), then any 3 s (at most two) and so on. If for fixed k there is more than one k in P ST then these are dealt with in turn from top to bottom.…”
Section: Resultsmentioning
confidence: 99%
“…The technique is to apply the jeu de taquin [6,8,13,14,18] to the primed entries k of P ST taken in turn starting with any 1 s (actually there are none), then any 2 s (at most one), then any 3 s (at most two) and so on. If for fixed k there is more than one k in P ST then these are dealt with in turn from top to bottom.…”
Section: Resultsmentioning
confidence: 99%
“…Then T is obtained from P by a series of internal column insertions. Adapting the arguments of [15], we see that internal column insertion preserves Knuth equivalence. Thus P is Knuth equivalent to T. Since C is symmetric in its two arguments, Q is Knuth equivalent to U.…”
Section: 2mentioning
confidence: 88%
“…These algorithms were originally developed for tableaux of partition shape, but more recent work [4,15] uses them to define operations on pairs of skew tableaux. A striking duality between Schensted insertion and Schu tzenberger's jeu de taquin was noted by Stembridge [21] in his theory of rational tableaux.…”
Section: Introductionmentioning
confidence: 99%
“…Now, we recover the Knuth type correspondence for skew tableaux by Sagan and Stanley [17] as a restriction of the bijection in Theorem 5.1 to the set of LR words of shape (α, β). Theorem 5.5 Let α, β ∈ P be given.…”
Section: Remark 413mentioning
confidence: 91%