A straightening algorithm for row-convex tableaux (Q5929446): Difference between revisions
From MaRDI portal
Latest revision as of 16:05, 3 June 2024
scientific article; zbMATH DE number 1585058
Language | Label | Description | Also known as |
---|---|---|---|
English | A straightening algorithm for row-convex tableaux |
scientific article; zbMATH DE number 1585058 |
Statements
A straightening algorithm for row-convex tableaux (English)
0 references
27 August 2001
0 references
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. Reiner 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. Finally, 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.
0 references
Schur module
0 references
Weyl module
0 references
row-convex tableaux
0 references
straightening algorithm
0 references
general linea Lie superalgebra
0 references
letterplace superalgebra
0 references
Groebner basis
0 references
SAGBI basis
0 references
0 references
0 references