Year: 2026
Type: article
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.
Source: Algebraic Combinatorics
DOI: 10.5802/alco.517
Authors: Igor Pak, Colleen Robichaux
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W4415308114
