Dual graded graphs for Kac-Moody algebras
Thomas Lam, Mark Shimozono

TL;DR
This paper introduces dual graded graphs associated with Kac-Moody algebras, extending combinatorial structures like insertion algorithms and analyzing their subposets, inspired by affine Schubert calculus.
Contribution
It constructs dual graded graphs for any Kac-Moody algebra, generalizing strong and weak orders, and develops folded insertion methods including shifted insertion as a special case.
Findings
Constructed dual graded graphs for arbitrary Kac-Moody algebras.
Defined folded insertion algorithms generalizing classical insertions.
Analyzed subgraphs as distributive posets, connecting to combinatorial representation theory.
Abstract
Motivated by affine Schubert calculus, we construct a family of dual graded graphs for an arbitrary Kac-Moody algebra . The graded graphs have the Weyl group of as vertex set and are labeled versions of the strong and weak orders of respectively. Using a construction of Lusztig for quivers with an admissible automorphism, we define folded insertion for a Kac-Moody algebra and obtain Sagan-Worley shifted insertion from Robinson-Schensted insertion as a special case. Drawing on work of Stembridge, we analyze the induced subgraphs of which are distributive posets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
