Details:
Title  A Straightening Algorithm for RowConvex Tableaux  Author(s)  Brian D. Taylor  Text  B. D. Taylor, A straightening algorithm for rowconvex tableaux, math.CO/9908130.  Type  Article in Journal  Abstract  We produce a new basis for the Schur and Weyl modules associated to a rowconvex 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 rowconvex 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.  Copyright  Academic Press 
URL 
dx.doi.org/10.1006/jabr.2000.8495 
Language  English  Journal  Journal of Algebra  Volume  236  Number  1  Pages  155  191  Year  2001  Month  February  Edition  0  Translation 
No  Refereed 
No 
