Bumping operators and insertion algorithms for queer supercrystals (Q2071746)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bumping operators and insertion algorithms for queer supercrystals
scientific article

    Statements

    Bumping operators and insertion algorithms for queer supercrystals (English)
    0 references
    0 references
    31 January 2022
    0 references
    Crystal bases or (Kashiwara) crystals are combinatorial objects that arise in the representation theory of Lie algebras and quantum groups. The author of this paper studies abstract crystals for the general linear Lie algebra \(\mathfrak{gl}_n\) and the queer Lie superalgebra \(\mathfrak{q}_n\) (the second superanalogue of \(\mathfrak{gl}_n\)). The data of an abstract \(\mathfrak{gl}_n\)-crystal or \(\mathfrak{q}_n\)-crystal is equivalent to a certain directed weighted crystal graph. Under this identification, crystal isomorphisms correspond to graph isomorphisms. The weakly connected components of a crystal graph are called its full subcrystals. The categories of \(\mathfrak{gl}_n\)-crystals and \(\mathfrak{q}_n\)-crystals are both equipped with a tensor product and a standard crystal \(\mathbb{B}_n\), which is derived from the vector representation of the associated Lie superalgebra. It is an interesting problem to determine whether or not an abstract crystal is normal in the sense of being isomorphic to a disjoint union of full subcrystals of tensor powers of \(\mathbb{B}_n\) since such abstract crystals will correspond to actual representations of the associated Lie superalgebra. The prototypical example of a normal \(\mathfrak{gl}_n\)-crystal is the set of semistandard Young tableaux with entries in \(\{1,2,\ldots,n\}\). The \(\mathfrak{q}_n\)-analogues of these crystals have two combinatorial models, either as semistandard decomposition tableaux [\textit{D. Grantcharov} et al., Trans. Am. Math. Soc. 366, No. 1, 457--489 (2014; Zbl 1336.17013)] or semistandard shifted tableaux (e.g., see [\textit{T. Hiroshima}, Publ. Res. Inst. Math. Sci. 55, No. 2, 369--399 (2019; Zbl 1416.05294)]). Another source of crystal constructions comes from reduced words. Results of [\textit{J. Morse} and \textit{A. Schilling}, Int. Math. Res. Not. 2016, No. 8, 2239--2294 (2016; Zbl 1404.14057)] show that the set of increasing factorizations of reduced words for a permutation is naturally a crystal for the general linear Lie algebra. \textit{T. Hiroshima} [``Queer supercrystal structure for increasing factorizations of fixed-point-free involution words'', Preprint, \url{arXiv:1907.10836}] constructed two superalgebra analogues of such crystals. Specifically, Hiroshima has shown that the sets of increasing factorizations of involution words and fpf-involution words for a self-inverse permutation are each crystal for the queer Lie superalgebra. In this paper, the author proves that these crystals are normal and identifies their connected components. To accomplish this, two insertion algorithms that may be viewed as shifted analogues of the Edelman-Greene correspondence are studied [\textit{P. Edelman} and \textit{C. Greene}, Adv. Math. 63, 42--99 (1987; Zbl 0616.05005)]. Furthermore, the author proves that the connected components of Hiroshima's crystals are the subsets of factorizations with the same insertion tableau for these algorithms and that passing to the recording tableau defines a crystal morphism. This confirms a conjecture of Hiroshima. This is proved by a detailed investigation of certain analogues of the Little map, through which several results of [\textit{Z. Hamaker} and \textit{B. Young}, J. Algebr. Comb. 40, No. 3, 693--710 (2014; Zbl 1309.05007)] are extended.
    0 references
    crystal bases
    0 references
    queer Lie superalgebra
    0 references
    increasing factorizations of reduced words
    0 references
    semistandard shifted tableaux.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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