AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-standard tableaux that generalizes the correspondence for skew oscillating standard tableaux. We give a geometric construction for skew oscillating semi-standard tableaux and examine its combinatorial properties
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
AbstractLet the sign of a skew standard Young tableau be the sign of the permutation you get by read...
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These corr...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics a...
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it r...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
AbstractLet the sign of a skew standard Young tableau be the sign of the permutation you get by read...
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These corr...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics a...
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it r...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
DOI
Add to ORKG