No label defined (Q5693299)

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 2207656
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2207656

      Statements

      0 references
      0 references
      24 September 2005
      0 references
      loop Grassmannians
      0 references
      MV-cycles
      0 references
      MV-polytopes
      0 references
      cluster algebras
      0 references
      Let \(G\) be a connected complex reductive algebraic group. By definition, the loop Grassmannian \({\mathfrak G}\) is the quotient \(G(\mathbb{C}((t)))/G(\mathbb{C}[[t]])\). The loop Grassmannian may be realized as an increasing union of finite-dimensional complex algebraic varieties. In type A, when \(G=\text{SL}(n)\) or \(\text{GL}(n)\), there is a simple lattice model for the loop Grassmannian, which allows to study \({\mathfrak G}\) using finite-dimensional linear algebra. The main results of the article are concerned with certain finite-dimensional algebraic subvarieties of \({\mathfrak G}\), which the authors call MV-cycles. They were introduced in [\textit{I. Mirković} and \textit{K.Vilonen}, Math. Res. Lett. 7, 1, 13--24 (2000; Zbl 0987.14015)]. These subvarieties provide a canonical basis of algebraic cycles for the intersection homology of the closures of the strata of \({\mathfrak G}\), for the natural stratification by \(G(\mathbb{C}[[t]])\)-orbits. The partition of the loop Grassmannian into smooth pieces such that the MV-cycles are their closures is constructed. The partition is invariant under the action of the coweights and, up to this action, the pieces are parametrized by the Kostant parameter set. This description of MV-cycles allows to compute the moment map images of the MV-cycles (MV-polytopes) by identifying the vertices of each polytope. The main part of the article is largely self-contained, using only linear algebra, combinatorics, and the most basic complex algebraic geometry.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references