Pieri resolutions for classical groups. (Q549999): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: PieriMaps / rank
 
Normal rank

Revision as of 22:18, 28 February 2024

scientific article
Language Label Description Also known as
English
Pieri resolutions for classical groups.
scientific article

    Statements

    Pieri resolutions for classical groups. (English)
    0 references
    0 references
    0 references
    19 July 2011
    0 references
    Let \(K\) be a field of characteristic zero, \(V\) an \(n\)-dimensional vector space, \(A=\text{Sym}(V)\cong K[x_1,\dots,x_n]\) the polynomial ring in \(n\) variables over the field \(K\) and \(\text{GL}(V)\) the general linear group, which can be viewed as an algebraic group over \(K\). For a partition \(\alpha\), one denotes by \(\mathbf S_\alpha V\) the irreducible representation of \(\text{GL}(V)\) of highest weight \(\alpha\). Let \(\alpha,\beta\) be two partitions such that \(\alpha_1<\beta_1\) and \(\alpha_i=\beta_i\) for all \(i>1\). \textit{D. Eisenbud, G. Fløystad} and \textit{J. Weyman}, [Ann. Inst. Fourier 61, No. 3, 905-926 (2011; Zbl 1239.13023)], constructed the minimal free resolution of the cokernel of a nonzero map \(\varphi(\alpha,\beta)\colon A\otimes\mathbf S_\beta V\to A\otimes\mathbf S_\alpha V\). The authors give a simpler proof and extend the construction by removing the restrictions on the partitions \(\alpha\) and \(\beta\). Moreover, they give a simple combinatorial algorithm for writing down a (non-minimal, in general) free resolution of the cokernel of a nonzero map of the form \(\varphi(\alpha,\beta^1,\dots,\beta^r)\colon\bigoplus_{i=1}^r A\otimes\mathbf S_{\beta^i}V\to A\otimes \mathbf S_\alpha V\). The authors consider also the problem of replacing \(A\) by the exterior algebra \(B=\bigwedge V\). They show that, in this case, the resolution is still simple to describe combinatorially, even if it is infinite in length. The results from Eisenbud, Fløystad and Weyman [loc. cit.] are generalized for several classical groups such as orthogonal or symplectic groups. Finally, the authors consider the equivariant analogue of the Boij-Söderberg decomposition and they show that the equivariant analogue of the Boij-Söderberg algorithm for writing Betti tables as linear combinations of pure Betti tables does not hold.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    general linear groups
    0 references
    irreducible representations
    0 references
    minimal resolutions
    0 references
    Betti tables
    0 references
    Boij-Söderberg theory
    0 references
    symmetric functions
    0 references
    Schur functors
    0 references
    pure resolutions
    0 references
    equivariant resolutions
    0 references
    Betti diagrams
    0 references
    determinantal varieties
    0 references