A Littlewood-Richardson rule for dual stable Grothendieck polynomials. (English) Zbl 1366.05116
Summary: For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood-Richardson rule for the expansion of the corresponding dual stable Grothendieck polynomial in terms of Schur polynomials.
MSC:
| 05E05 | Symmetric functions and generalizations |
| 05A18 | Partitions of sets |
| 14N15 | Classical problems, Schubert calculus |
Keywords:
dual stable Grothendieck polynomials; reverse plane partitions; crystal operators; Littlewood-Richardson ruleReferences:
| [1] | Bandlow, J.; Morse, J., Combinatorial expansions in \(K\)-theoretic bases, Electron. J. Combin., 19, 4, Article Paper 39, 27 pp. (2012) · Zbl 1267.05037 |
| [2] | Buch, A. S., A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians, Acta Math., 189, 1, 37-78 (2002) · Zbl 1090.14015 |
| [3] | Fomin, S.; Kirillov, A. N., The Yang-Baxter equation, symmetric functions, and Schubert polynomials, (Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics. Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics, Florence, 1993, vol. 153 (1996)), 123-143 · Zbl 0852.05078 |
| [4] | Fulton, W., Young Tableaux: With Applications to Representation Theory and Geometry, London Math. Soc. Stud. Texts, vol. 35 (1997), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0878.14034 |
| [5] | Galashin, P.; Grinberg, D.; Liu, G., Refined dual stable Grothendieck polynomials and generalized Bender-Knuth involutions, Electron. J. Combin., 23, 3, Article Paper 3.14, 28 pp. (2016) · Zbl 1344.05148 |
| [6] | Kashiwara, M., On crystal bases, (Representations of Groups. Representations of Groups, Banff, AB, 1994. Representations of Groups. Representations of Groups, Banff, AB, 1994, Conf. Proc., Can. Math. Soc., vol. 16 (1995), Amer. Math. Soc.: Amer. Math. Soc. Providence, RI), 155-197 · Zbl 0851.17014 |
| [7] | Lam, T.; Pylyavskyy, P., Combinatorial Hopf algebras and \(K\)-homology of Grassmannians, Int. Math. Res. Not. IMRN, 2007, 24, Article 48 pp. (2007) · Zbl 1134.16017 |
| [8] | Lascoux, A.; Schützenberger, M.-P., Sur une conjecture de H.O. Foulkes, C. R. Acad. Sci. Paris Sér. A-B, 286, 7, A323-A324 (1978) · Zbl 0374.20010 |
| [9] | Lascoux, A.; Schützenberger, M.-P., Le monoïde plaxique, (Noncommutative Structures in Algebra and Geometric Combinatorics. Noncommutative Structures in Algebra and Geometric Combinatorics, Naples, 1978. Noncommutative Structures in Algebra and Geometric Combinatorics. Noncommutative Structures in Algebra and Geometric Combinatorics, Naples, 1978, Quad. Ric. Sci., vol. 109 (1981), CNR: CNR Rome), 129-156 · Zbl 0517.20036 |
| [10] | Lascoux, A.; Schützenberger, M.-P., Structure de Hopf de l’anneau de cohomologie et de l’anneau de Grothendieck d’une variété de drapeaux, C. R. Acad. Sci. Paris Sér. I Math., 295, 11, 629-633 (1982) · Zbl 0542.14030 |
| [11] | Lenart, C., Combinatorial aspects of the \(K\)-theory of Grassmannians, Ann. Comb., 4, 1, 67-82 (2000) · Zbl 0958.05128 |
| [12] | Littelmann, P., A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras, Invent. Math., 116, 1-3, 329-346 (1994) · Zbl 0805.17019 |
| [13] | Remmel, J. B.; Shimozono, M., A simple proof of the Littlewood-Richardson rule and applications, Discrete Math., 193, 1-3, 257-266 (1998), selected papers in honor of Adriano Garsia, Taormina, 1994 · Zbl 1061.05507 |
| [14] | Stembridge, J. R., A local characterization of simply-laced crystals, Trans. Amer. Math. Soc., 355, 12, 4807-4823 (2003), (electronic) · Zbl 1047.17007 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
