Straightening codeterminants (Q686049): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3900247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorics and the Schur algebra / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-4049(93)90032-o / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4212963175 / rank | |||
Normal rank |
Latest revision as of 10:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Straightening codeterminants |
scientific article |
Statements
Straightening codeterminants (English)
0 references
22 March 1995
0 references
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.
0 references
codeterminants
0 references
canonical basis elements
0 references
Schur algebra
0 references
straightening algorithm
0 references
bideterminants
0 references