Saved in:
Bibliographic Details
Main Authors: Chou, Jack Chen-An, Yu, Tianyi
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2512.12185
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909959665483776
author Chou, Jack Chen-An
Yu, Tianyi
author_facet Chou, Jack Chen-An
Yu, Tianyi
contents Lam, Lee, and Shimozono introduced the double Stanley symmetric functions in their study of the equivariant geometry of the affine Grassmannian. They proved that the associated double Edelman--Greene coefficients, the double Schur expansion coefficients of these functions, are positive, a result later refined by Anderson. They further asked for a combinatorial proof of this positivity. In this paper, we provide the first such proof, together with a combinatorial formula that manifests the finer positivity established by Anderson. Our formula is built from two combinatorial models: bumpless pipedreams and increasing chains in the Bruhat order. The proof relies on three key ingredients: a correspondence between these two models, a natural subdivision of bumpless pipedreams, and a symmetry property of increasing chains.
format Preprint
id arxiv_https___arxiv_org_abs_2512_12185
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A positive combinatorial formula for the double Edelman--Greene coefficients
Chou, Jack Chen-An
Yu, Tianyi
Combinatorics
Lam, Lee, and Shimozono introduced the double Stanley symmetric functions in their study of the equivariant geometry of the affine Grassmannian. They proved that the associated double Edelman--Greene coefficients, the double Schur expansion coefficients of these functions, are positive, a result later refined by Anderson. They further asked for a combinatorial proof of this positivity. In this paper, we provide the first such proof, together with a combinatorial formula that manifests the finer positivity established by Anderson. Our formula is built from two combinatorial models: bumpless pipedreams and increasing chains in the Bruhat order. The proof relies on three key ingredients: a correspondence between these two models, a natural subdivision of bumpless pipedreams, and a symmetry property of increasing chains.
title A positive combinatorial formula for the double Edelman--Greene coefficients
topic Combinatorics
url https://arxiv.org/abs/2512.12185