An inverse Grassmannian Littlewood-Richardson rule and extensions

Oliver Pechenik, Anna Weigandt

Research output: Contribution to journalArticlepeer-review

Abstract

Chow rings of flag varieties have bases of Schubert cycles, indexed by permutations. A major problem of algebraic combinatorics is to give a positive combinatorial formula for the structure constants of this basis. The celebrated Littlewood-Richardson rules solve this problem for special products, where u and v are p-Grassmannian permutations. Building on work of Wyser, we introduce backstable clans to prove such a rule for the problem of computing the product when u is p-inverse Grassmannian and v is q-inverse Grassmannian. By establishing several new families of linear relations among structure constants, we further extend this result to obtain a positive combinatorial rule for in the case that u is covered in weak Bruhat order by a p-inverse Grassmannian permutation and v is a q-inverse Grassmannian permutation.

Original languageEnglish (US)
Article numbere114
JournalForum of Mathematics, Sigma
Volume12
DOIs
StatePublished - Dec 3 2024

Bibliographical note

Publisher Copyright:
© The Author(s), 2024. Published by Cambridge University Press.

Keywords

  • 14N15 05E05 05E14 14M15

Fingerprint

Dive into the research topics of 'An inverse Grassmannian Littlewood-Richardson rule and extensions'. Together they form a unique fingerprint.

Cite this