Straightening codeterminants (Q686049): Difference between revisions

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.