Twisted Demazure modules, fusion product decomposition and twisted 𝑄-systems
Bibliographic record
Abstract
In this paper, we introduce a family of indecomposable finite-dimensional graded modules for the twisted current algebras. These modules are indexed by an | R + | |R^+| -tuple of partitions ξ = ( ξ α ) α ∈ R + \xi =(\xi ^{\alpha })_{\alpha \in R^+} satisfying a natural compatibility condition. We give three equivalent presentations of these modules and show that for a particular choice of ξ \xi these modules become isomorphic to Demazure modules in various levels for the twisted affine algebras. As a consequence we see that the defining relations of twisted Demazure modules can be greatly simplified. Furthermore, we investigate the notion of fusion products for twisted modules, first defined by Feigin and Loktev in 1999 for untwisted modules, and use the simplified presentation to prove a fusion product decomposition of twisted Demazure modules. As a consequence we prove that twisted Demazure modules can be obtained by taking the associated graded modules of (untwisted) Demazure modules for simply-laced affine algebras. Furthermore we give a semi-infinite fusion product construction for the irreducible representations of twisted affine algebras. Finally, we prove that the twisted Q Q -sytem defined by Hatayama et al. in 2001 extends to a non-canonical short exact sequence of fusion products of twisted Demazure modules.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.009 | 0.002 |
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".