Pieri resolutions for classical groups. (Q549999): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Anda-Georgina Olteanu / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20G05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13D02 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14M12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14L35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5925844 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
general linear groups | |||
Property / zbMATH Keywords: general linear groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
irreducible representations | |||
Property / zbMATH Keywords: irreducible representations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimal resolutions | |||
Property / zbMATH Keywords: minimal resolutions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Betti tables | |||
Property / zbMATH Keywords: Betti tables / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Boij-Söderberg theory | |||
Property / zbMATH Keywords: Boij-Söderberg theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
symmetric functions | |||
Property / zbMATH Keywords: symmetric functions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Schur functors | |||
Property / zbMATH Keywords: Schur functors / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pure resolutions | |||
Property / zbMATH Keywords: pure resolutions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
equivariant resolutions | |||
Property / zbMATH Keywords: equivariant resolutions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Betti diagrams | |||
Property / zbMATH Keywords: Betti diagrams / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
determinantal varieties | |||
Property / zbMATH Keywords: determinantal varieties / rank | |||
Normal rank |
Revision as of 13:24, 1 July 2023
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
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
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