A straightening algorithm for row-convex tableaux

DOI10.1006/JABR.2000.8495MaRDI QIDQ5929446zbMATH OpenOpenAlexFDO

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

general linea Lie superalgebra Groebner basis letterplace superalgebra row-convex tableaux SAGBI basis Schur module straightening algorithm Weyl 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)

Abstract: We produce a new basis for the Schur and Weyl modules associated to a row-convex shape, D. The basis is indexed by new class of "straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is proved via a new straightening algorithm for expanding elements of the representation into this basis. For skew shapes, this algorithm specializes to the classical straightening law. The new straight basis is used to produce bases for flagged Schur and Weyl modules, to provide Groebner and sagbi bases for the homogeneous coordinate rings of some configuration varieties and to produce a flagged branching rule for row-convex representations. Systematic use of supersymmetric letterplace techniques enables the representation theoretic results to be applied to representations of the general linear Lie superalgebra as well as to the general linear group.

Review text

It is well known that for each partition \(\lambda\) of a natural number \(n\), there is a Weyl module \(V(\lambda)\) for the group \(\text{GL}_n\) of invertible matrices over a field. The partition \(\lambda=(\lambda_1,\lambda_2,\ldots ,\lambda_r)\), with \(\lambda_1\geq \lambda_2\geq \cdots\geq\lambda _r\geq 0\), can be regarded as a diagram (Young diagram) in the plane, consisting of boxes in rows: \(\lambda_k\) boxes in the \(k\)th row, for \(k=1,2,\ldots ,r\). \textit{K. Akin, D. A. Buchsbaum} and \textit{J. Weyman} [Adv. Math. 44, 207-278 (1982; Zbl 0497.15020)] have given a construction which associates a \(\text{GL}_n\)-module to any shape in the plane---the restriction that each row and column be convex (i.e. no gaps) is lifted. NEWLINENEWLINENEWLINEReiner and Shmozon and Lakshmibai and Magyar have made significant progress in describing bases for these modules, obtained by certain fillings of these diagrams (as in the partition case) by the numbers from \(1\) to \(n\). In the paper under review, the author considers the case where the shape is row-convex (i.e. no gaps between boxes in any row). He constructs a new basis (called a straight basis) for such a module consisting of such fillings (tableaux), and demonstrates some of its nice properties. He gives a local condition for such tableaux to lie in the basis, and a straightening law for arbitrary tableaux which modifies only two rows at a time. The straight basis also descends naturally to a basis of the corresponding flagged module. NEWLINENEWLINENEWLINEFinally, applications are considered -- the straight basis and the straightening algorithm may be applied to produce quadratic Groebner bases and SAGBI bases for the homogeneous coordinate rings of certain configuration varieties, and the basis can be used to produce a branching rule for decomposing a row-convex \(\text{GL}_n\)-module in terms of \(\text{GL}_{n-1}\)-modules. The paper is written in the generality of the general linear Lie superalgebras -- Schur and Weyl modules are special cases of the super-Schur modules over these algebras. The paper includes a new presentation of the requisite background in superalgebras.

Recommendations

Cites work

Cited in

(11)

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

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