Straightening Laws for Row-Convex Tableaux
نویسنده
چکیده
We introduce the notion of a straight tableau and prove that the straight tableaux of xed row-convex shape form a basis for the GL n -representations and the general linear Lie superalgebra representations associated to the given shape. We provide a straightening algorithm for expressing arbitrary tableaux in terms of straight tableaux. These techniques can be modi ed to provide bases for representations associated to a set of row-convex tableaux. To this end we introduce the notion of an anti-straight tableau and prove analogous basis and straightening theorems. These results are characteristic-free and generalize to agged B n -representations and to quantum Schur modules. Some applications to homogeneous coordinate rings of con guration varieties are given.
منابع مشابه
A straightening algorithm for row-convex tableaux
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 classi...
متن کاملGENERALIZED STRAIGHTENING LAWS FOR PRODUCTS OF DETERMINANTS by BRIAN
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous coordinate rings of flag varieties under the Plicker embedding. In representation theory, the irreducible representations of GL,(C) arise as the multihomogeneous components of these rings. I introduce a new class of straight tableau by slightly weakening the requiremen...
متن کاملGeneralized Straightening Laws for Products of Determinants
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous coordinate rings of flag varieties under the Plücker embedding. In representation theory, the irreducible representations of GLn(C) arise as the multihomogeneous components of these rings. I introduce a new class of straight tableau by slightly weakening the requiremen...
متن کاملRow-convex tableaux and the combinatorics of initial terms
We characterize the initial terms under a diagonal term order of the supersymmetric Schur/Weyl module S(V V ) associated to a row-convex shape D. We show the biwords corresponding to the initial terms of S are closed under dual-Knuth equivalence and that the recording tableaux for these words are decomposable in the sense of [10]. We consider the natural action of bases of S in which the elemen...
متن کامل