Peer-reviewedCC BY 4.0Algebraic Combinatorics
Signed puzzles for Schubert coefficients
- 1University of California, Los Angeles, Department of Mathematics, 520 Portola Plaza, Los Angeles, CA 90095 (USA)
- 2University of California, Davis, One Shields Ave., Mathematical Science Building, Davis, CA 95616 (USA)
Abstract
We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson’s recurrence [12]. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded number of inversions.
Related
- Polynomiality of Stretched Schubert Structure Constants and Key Coefficients
- Coefficient lifting for skew divided differences and triple Schubert coefficients
- Turán coefficients of signed graphs
- Graph Puzzles III.1: A Proof of Sabidussi's Compatibility Conjecture
- Universal Plücker coordinates for the Wronski map and positivity in real Schubert calculus
BibTeX
@article{pak2026signed,
title = {{Signed puzzles for Schubert coefficients}},
author = {Igor Pak and Colleen Robichaux},
journal = {Algebraic Combinatorics},
year = {2026},
month = oct,
doi = {10.5802/alco.517},
url = {https://alco.centre-mersenne.org/articles/10.5802/alco.517/},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Signed puzzles for Schubert coefficients
AU - Igor Pak
AU - Colleen Robichaux
PY - 2026
DA - 2026/10/27
JO - Algebraic Combinatorics
DO - 10.5802/alco.517
UR - https://alco.centre-mersenne.org/articles/10.5802/alco.517/
AB - We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson’s recurrence [12]. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded number of inversions.
SN - 2589-5486
ER -