Schubert polynomials and $k$-Schur functions (Extended abstract)
Bibliographic record
Abstract
The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function can be understood from the multiplication in the space of dual $k$-Schur functions. Using earlier work by the second author, we encode both problems by means of quasisymmetric functions. On the Schubert vs. Schur side, we study the $r$-Bruhat order given by Bergeron-Sottile, along with certain operators associated to this order. On the other side, we connect this poset with a graph on dual $k$-Schur functions given by studying the affine grassmannian order of Lam-Lapointe-Morse-Shimozono. Also, we define operators associated to the graph on dual $k$-Schur functions which are analogous to the ones given for the Schubert vs. Schur problem. Le but principal de cet article est de montrer que la multiplication d’un polynôme de Schubert de type fini $A$ par une fonction de Schur peut être comprise à partir de la multiplication dans l’espace dual des fonctions $k$-Schur. Les travaux antérieurs par le second auteur, nous permet de coder ces deux problèmes au moyen de fonctions quasi-symétriques. Du côté Schubert vs Schur, nous étudions l’ordre partiel $r$-Bruhat donné par Bergeron-Sottile, ainsi que certains opérateurs associés à cet ordre. Nous donnons une relation entre l’ordre $r$-Bruhat et le graphe de Bruhat sur les fonctions $k$-Schur duales données par l’étude de l’ordre affine grassmannienne de Lam-Lapointe-Morse-Shimozono. En outre, nous définissons des opérateurs associés a ce graphe qui sont analogues à ceux donnés pour le problème Schubert vs Schur.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".