AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tableaux and we propose a geometric version of this correspondence, extending similar constructions for standard (Combinatoire et représentation du groupe symétrique, Lecture Notes in Mathematics, Vol. 579, Springer, Berlin, 1977, pp. 29–58) and oscillating tableaux (Formal Power Series and Algebraic Combinatorics, FPSAC’99, Univ. Politecnicà de Catalunya, 1999, pp. 141–152). We deduce from this geometric construction new proofs of some combinatorial properties of this correspondence
AbstractTableaux have long been used to study combinatorial properties of permutations and multiset ...
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it r...
This dissertation is in the field of Algebraic and Enumerative Combinatorics. In the first part of t...
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 introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
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...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
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...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics a...
AbstractUsing growth diagrams, we define a skew domino Schensted correspondence which is a domino an...
AbstractTableaux have long been used to study combinatorial properties of permutations and multiset ...
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it r...
This dissertation is in the field of Algebraic and Enumerative Combinatorics. In the first part of t...
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 introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
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...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
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...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics a...
AbstractUsing growth diagrams, we define a skew domino Schensted correspondence which is a domino an...
AbstractTableaux have long been used to study combinatorial properties of permutations and multiset ...
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it r...
This dissertation is in the field of Algebraic and Enumerative Combinatorics. In the first part of t...