Straightening codeterminants
In [ibid. 88, 89-106 (1993; Zbl 0794.20053)] \textit{J. A.Green} introduces codeterminants, products of pairs of canonical basis elements of the Schur algebra, and uses them to give elementary proofs of certain fundamental representation-theoretic properties of the Schur algebra. The basic combinatorial input required for this approach is the straightening algorithm for bideterminants (see [loc. cit.] for the relevant references). Green poses the problem (see the remark following [loc. cit. Theorem 6.2]) of giving an algorithm for `straightening' codeterminants, i.e. expressing an arbitrary codeterminant as a linear combination of standard codeterminants. In this note, which may be considered as an addendum to Green's paper, we describe such an algorithm. The proof is combinatorial, and makes no use of the corresponding result for bideterminants.
- The partition algebras and a new deformation of the Schur algebras
- Semisimplification of the category of tilting modules for \(\mathrm{GL}_n\)
- Codeterminants and \(q\)-Schur algebras.
- \(q\)-Schur subalgebras.
- TURBO-STRAIGHTENING FOR DECOMPOSITION INTO STANDARD BASES
- scientific article; zbMATH DE number 637351 (Why is no real title available?)
- A bideterminant basis for a reductive monoid
- A straightening formula for quantized codete11minants
- The rational Schur algebra
- CODETERMINANTS FOR THE SYMPLECTIC SCHUR ALGEBRA
- Schurifying quasi‐hereditary algebras
- The \(q\)-Schur category and polynomial tilting modules for quantum \(\mathrm{GL}_n\)
- Complements of tableaux and straightening bideterminants
- The dotted straightening algorithm
This page was built for publication: Straightening codeterminants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686049)