AbstractWe give a natural decomposition of the set of standard Young tableaux of a given shape into intervals with respect to the weak Bruhat order; each class is completely determined by a partial order on letters which admits a remarkable planar representation
AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
AbstractThe Schensted correspondence is closely related to the decomposition of V⊗n as a GL(V)-modul...
AbstractThe Littlewood-Richardson construction is shown to yield the same collection of standard tab...
Stanley conjectured that the number of maximal chains in the weak Bruhat order of S n, or equivalent...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
AbstractLet SYTn be the set of all standard Young tableaux with n cells. After recalling the definit...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
We consider pictures as defined by Zelevinsky. We elaborate on the generalisation of the Robinson-Sc...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These corr...
AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
AbstractThe Schensted correspondence is closely related to the decomposition of V⊗n as a GL(V)-modul...
AbstractThe Littlewood-Richardson construction is shown to yield the same collection of standard tab...
Stanley conjectured that the number of maximal chains in the weak Bruhat order of S n, or equivalent...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
AbstractLet SYTn be the set of all standard Young tableaux with n cells. After recalling the definit...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
We consider pictures as defined by Zelevinsky. We elaborate on the generalisation of the Robinson-Sc...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These corr...
AbstractWe introduce an analogue of the Robinson–Schensted correspondence for skew oscillating semi-...
AbstractThe Schensted correspondence is closely related to the decomposition of V⊗n as a GL(V)-modul...
AbstractThe Littlewood-Richardson construction is shown to yield the same collection of standard tab...
DOI
Add to ORKG