Embedding Bumpless Pipedreams as Bruhat Chains

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 the 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–Kirillov 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 conjecturally agrees with the existing bijection of Gao and Huang.

Authors

Institutions

Publication Details

Journal
International Mathematics Research Notices
Published
2025-11-01
DOI
https://doi.org/10.1093/imrn/rnaf336
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Embedding Bumpless Pipedreams as Bruhat Chains

Tianyi Yu
International Mathematics Research Notices
Advanced Combinatorial Mathematics
article

Embedding Bumpless Pipedreams as Bruhat Chains

Tianyi Yu
article en

Abstract

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 the 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–Kirillov 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 conjecturally agrees with the existing bijection of Gao and Huang.

International Mathematics Research NoticesVol. 2025(22)
Université du Québec à Montréal (CA)
Openalex Percentile: Top 58%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.