Modules of the 0-Hecke algebra and quasisymmetric Schur functions
Bibliographic record
Abstract
We begin by deriving an action of the 0-Hecke algebra on standard reverse composition tableaux and use it to discover 0-Hecke modules whose quasisymmetric characteristics are the natural refinements of Schur functions known as quasisymmetric Schur functions. Furthermore, we classify combinatorially which of these 0-Hecke modules are indecomposable. From here, we establish that the natural equivalence relation arising from our 0-Hecke action has equivalence classes that are isomorphic to subintervals of the weak Bruhat order on the symmetric group. Focussing on the equivalence classes containing a canonical tableau we discover a new basis for the Hopf algebra of quasisymmetric functions, and use the cardinality of these equivalence classes to establish new enumerative results on truncated shifted reverse tableau studied by Panova and Adin-King-Roichman. Generalizing our 0-Hecke action to one on skew standard reverse composition tableaux, we derive 0-Hecke modules whose quasisymmetric characteristics are the skew quasisymmetric Schur functions of Bessenrodt et al. This enables us to prove a restriction rule that reflects the coproduct formula for quasisymmetric Schur functions, which in turn yields a quasisymmetric branching rule analogous to the classical branching rule for Schur functions.
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.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".