Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Embedding bumpless pipedreams as Bruhat chains (2407.05904v1)

Published 8 Jul 2024 in math.CO

Abstract: Schubert polynomials are distinguished representatives of Schubert cycles in the cohomology of the flag variety. In the spirit of Bergeron and Sottile, we use the Bruhat order to give $(n-1)!$ different combinatorial formulas for the Schubert polynomial of a permutation in $S_n$. By work of Lenart and Sottile, one extreme of the formulas recover the classical Pipedream (PD) formula. We prove the other extreme corresponds to Bumpless pipedreams (BPDs). We give two applications of this perspective to view BPDs: Using the Fomin-Kirrilov algebra, we solve the problem of finding a BPD analogue of Fomin and Stanley's algebraic construction on PDs; We also establish a bijection between PDs and BPDs using Lenart's growth diagram, which conjectually agrees with the existing bijection of Gao and Huang.

Citations (2)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube