1994
DOI: 10.1016/0097-3165(94)90039-6
|View full text |Cite
|
Sign up to set email alerts
|

Insertion and the multiplication of rational schur functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2000
2000
2011
2011

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…For a combinatorial realization, most crystals in this paper are embedded in a set of binary matrices of various shapes, equivalently an (infinite) abacus model. Also, two kinds of Kashiwara operators on binary matrices [4,17,20], which produces various dualities, play a crucial role in proving our main results, while the rational semistandard tableaux for gl n [25,26] were used to understand extremal weight crystals of type A +∞ [18].…”
Section: This Work Was Supported By Lg Yonam Foundationmentioning
confidence: 99%
“…For a combinatorial realization, most crystals in this paper are embedded in a set of binary matrices of various shapes, equivalently an (infinite) abacus model. Also, two kinds of Kashiwara operators on binary matrices [4,17,20], which produces various dualities, play a crucial role in proving our main results, while the rational semistandard tableaux for gl n [25,26] were used to understand extremal weight crystals of type A +∞ [18].…”
Section: This Work Was Supported By Lg Yonam Foundationmentioning
confidence: 99%
“…Either an entry of P C will be bumped from P C or this reverse insertion will result in a new box on the inner border of P C . Stroomer [22] showed that in the first case, it is not permissible to begin a column slide at b on P, and in the second case, the column slide is permissible, and T C is the tableau obtained from the (internal) column insertion. Thus P C and T C are Knuth equivalent, and so by Theorem 2.2, P and T are Knuth equivalent.…”
Section: Jeux De Tableauxmentioning
confidence: 98%
“…In combinatorial representation theory, complementation provides a combinatorial model for the procedure of dividing by the determinantal representation of GL k . In this context, it was used by Stembridge [21] and Stroomer [22] to develop combinatorial algorithms for studying rational representations of GL k . (The classical Robinson-Schensted-Knuth correspondence [11,16,6] is used to study polynomial representations of GL k .)…”
Section: Complementationmentioning
confidence: 99%
See 1 more Smart Citation
“…Let us review an insertion algorithm for B µ,ν [10], which is an infinite analogue of those for rational semistandard tableaux for gl n [17,18]. For a ∈ N and (S, T ) ∈ B µ,ν , we define a → (S, T ) in the following way;…”
Section: And J < L)mentioning
confidence: 99%