The full Kostant-Toda hierarchy on the positive flag variety
Yuji Kodama, Lauren Williams

TL;DR
This paper explores the geometric and combinatorial structure of the full Kostant-Toda hierarchy on the positive flag variety, revealing connections to convex polytopes, the Bruhat order, and symmetric Toda systems.
Contribution
It introduces the concept of Bruhat interval polytopes as convex hulls related to the f-KT hierarchy and links solutions to the symmetric Toda hierarchy, expanding understanding of integrable systems.
Findings
f-KT flows are complete on the tnn flag variety
Asymptotics are determined by Rietsch's cell decomposition
Bruhat interval polytopes are generalized permutohedra
Abstract
We study some geometric and combinatorial aspects of the solution to the full Kostant-Toda (f-KT) hierarchy, when the initial data is given by an arbitrary point on the totally non-negative (tnn) flag variety of SL_n(R). The f-KT flows on the tnn flag variety are complete, and their asymptotics are completely determined by the cell decomposition of the tnn flag variety given by Rietsch. We define the f-KT flow on the weight space via the moment map, and show that the closure of each f-KT flow forms an interesting convex polytope generalizing the permutohedron which we call a Bruhat interval polytope. We also prove analogous results for the full symmetric Toda hierarchy, by mapping our f-KT solutions to those of the full symmetric Toda hierarchy. In the Appendix we show that Bruhat interval polytopes are generalized permutohedra, in the sense of Postnikov, and that their edges correspond…
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.
