A straightening algorithm for row-convex tableaux

DOI10.1006/jabr.2000.8495zbMath0967.05065arXivmath/9908130OpenAlexW2003358394MaRDI QIDQ5929446

Brian D. Taylor

Publication date: 27 August 2001

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9908130

zbMATH Keywords

general linea Lie superalgebraGroebner basisletterplace superalgebrarow-convex tableauxSAGBI basisSchur modulestraightening algorithmWeyl module

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Representations of finite symmetric groups (20C30) Representation theory for linear algebraic groups (20G05)

Related Items (7)

Standard monomial theory for desingularized Richardson varieties in the flag variety \(\mathrm{GL}(n)/B\) ⋮ ROW CONVEX TABLEAUX AND BOTT–SAMELSON VARIETIES ⋮ Standard Monomial Theory of RR Varieties ⋮ Even-primitive vectors in induced supermodules for general linear supergroups and in costandard supermodules for Schur superalgebras ⋮ A sagbi basis for the quantum Grassmannian ⋮ Refinements of the Littlewood-Richardson rule ⋮ Compressed straight tableaux and a distributive lattice of representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic-free representation theory of the general linear group
• Schur functors and Schur complexes
• Remark on the branching theorem and supersymmetric algebras
• Specht series for skew representations of symmetric groups
• The theory of Lie superalgebras. An introduction
• Borel-Weil theorem for configuration varieties and Schur modules
• Percentage-avoiding, northwest shapes and peelable tableaux
• Flagged Weyl modules for two column shapes
• A vanishing theorem for Schur modules
• Addendum: Specht modules for column-convex diagrams: Characteristic-free results for Weyl modules
• Straightening for standard monomials on Schubert varieties
• Compressed straight tableaux and a distributive lattice of representations
• Specht series for column-convex diagrams
• Row-convex tableaux and the combinatorics of initial terms
• On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
• A new construction in homological algebra.
• Standard monomial theory for Bott-Samelson varieties
• Projective resolutions of Weyl modules.
• Algorithms in invariant theory

This page was built for publication: A straightening algorithm for row-convex tableaux