Row-convex tableaux and the combinatorics of initial terms

DOI10.1016/S0012-365X(99)00274-5zbMATH Open0969.05067MaRDI QIDQ1978193FDOQ1978193

Authors: B. D. Taylor 

Publication date: 3 October 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• A straightening algorithm for row-convex tableaux
• Presentations of Schur complexes attached to row convex shapes
• Compressed straight tableaux and a distributive lattice of representations

zbMATH Keywords

representationssupersymmetric algebrageneralized Young tableauxrow-convex shapestraight tableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorics on words (68R15)

Cited In (8)

• Compressed straight tableaux and a distributive lattice of representations
• On the combinatorics of row and corner transfer matrices of the \(A^{(1)}_{n-1}\) restricted face models.
• A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape
• Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions
• ROW CONVEX TABLEAUX AND BOTT–SAMELSON VARIETIES
• \(P\)-strict promotion and piecewise-linear rowmotion, with applications to flagged tableaux
• Even-primitive vectors in induced supermodules for general linear supergroups and in costandard supermodules for Schur superalgebras
• A straightening algorithm for row-convex tableaux

This page was built for publication: Row-convex tableaux and the combinatorics of initial terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978193)