Symplectic and orthogonal Robinson-Schensted algorithms (Q1775537): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jalgebra.2003.07.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013913704 / rank
 
Normal rank

Revision as of 00:44, 20 March 2024

scientific article
Language Label Description Also known as
English
Symplectic and orthogonal Robinson-Schensted algorithms
scientific article

    Statements

    Symplectic and orthogonal Robinson-Schensted algorithms (English)
    0 references
    0 references
    4 May 2005
    0 references
    Let \(G_{\mathbb{R}}\) be a linear reductive real Lie group with maximal compact subgroup \(K_{\mathbb{R}}\). Let \(K\) be the complexification of \(K_{\mathbb{R}}\) and let \(\mathcal{B}\) denote the flag variety of the complexified Lie algebra \(\mathfrak{g}\) of \(G_{\mathbb{R}}\). Let \(Q\) be a \(K\)-orbit on \(\mathcal{B}\) and denote by \(\mu\) the moment map from \(T^*\mathcal{B}\) to the nilpotent cone \(\mathcal{N}(\mathfrak{g}^*)\). The paper under review gives a simple algorithm to compute the image under \(\mu\) of the conormal bundle \(T_Q^*(\mathcal{B})\) explicitly when \(G_{\mathbb{R}}\) is \(\text{Sp}(2n,\mathbb{R})\) or \(O(p,q)\). Moreover, for a generic point \(\xi\) of the image of \(\mu\), the author obtains a new parametrization of the orbits of the component group of the centralizer of \(\xi\) in \(G\) on the irreducible components of the Springer fiber \(\mu^{-1}(\xi)\) in terms of the domino tableaux. This parametrization is closely related to the computation of annihilators of the derived functor modules for the groups under consideration. Similar questions were previously treated by A. Yamamoto, but her algorithms are different and not as well suited for the analysis of the components of the Springer fiber. The computations of this paper have very nice combinatorial interpretations as generalizations of the classical Robinson-Schensted algorithm.
    0 references
    representation
    0 references
    real reductive group
    0 references
    Young tableau
    0 references
    Robinson-Schensted algorithm
    0 references

    Identifiers