A computer algorithm for the BGG resolution (Q2216568)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7286503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computer algorithm for the BGG resolution |
scientific article; zbMATH DE number 7286503 |
Statements
A computer algorithm for the BGG resolution (English)
0 references
16 December 2020
0 references
This paper treats the famous BGG resolution from the algorithmic viewpoint, basing on the previous work by \textit{A. Lachowska} and \textit{Y. Qi} [Int. Math. Res. Not. 2018, No. 20, 6349--6405 (2018; Zbl 1460.17021)]. The paper provides a nice overview of the BGG resolution and its properties, including explanation how to use BGG resolution to compute cohomology of flag varieties, and can be read independently. Examples of computations are given, and further possible improvements of the algorithm are indicated. The code, written in Python as a part of SAGE, is available online.
0 references
BGG resolution
0 references
flag varieties
0 references
0.7529365420341492
0 references
0.7178581953048706
0 references
