The Schubert bialgebra
Matthew J. Samuel
Source abstract
We introduce a Schubert bialgebra , in which polynomials in different numbers of variables multiply to zero and the coproduct splits the variables into two consecutive blocks, and study its graded dual , whose product is concatenation of weak compositions. The Schubert polynomials form a basis of ; we give an explicit formula for the dual Schubert basis of via a transition formula to an elementary symmetric basis, and show that the Schubert structure constants are the coefficients of the coproduct of in the dual Schubert basis. The product of is then lifted to an associative product on the free abelian group of bounded RC graphs, built from a transition map on RC graphs that realizes the Lascoux-Schützenberger transition formula and generalizes Little's bumping algorithm. Quotienting by ideals coming from Demazure crystal equivalence, Nadeau-Tewari forest equivalence, and quasi-Yamanouchi equivalence yields manifestly positive Littlewood-Richardson rules for the dual Schubert, dual key, dual forest, and dual slide bases of . Read on , these are branching rules: enumerative formulas for splitting a Schubert, key, forest, or slide polynomial across two blocks of variables, and in the Schubert case they compute the Levi branching coefficients of Ressayre-Richmond for .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.