CATEGORIFICATION OF QUANTUM GENERALIZED KAC–MOODY ALGEBRAS AND CRYSTAL BASES
Bibliographic record
Abstract
We construct and investigate the structure of the Khovanov-Lauda–Rouquier algebras R and their cyclotomic quotients Rλ which give a categorification of quantum generalized Kac–Moody algebras. Let U𝔸(𝔤) be the integral form of the quantum generalized Kac–Moody algebra associated with a Borcherds–Cartan matrix A = (aij)i, j ∈ I and let K0(R) be the Grothendieck group of finitely generated projective graded R-modules. We prove that there exists an injective algebra homomorphism [Formula: see text] and that Φ is an isomorphism if aii ≠ 0 for all i ∈ I. Let B(∞) and B(λ) be the crystals of [Formula: see text] and V(λ), respectively, where V(λ) is the irreducible highest weight Uq(𝔤)-module. We denote by 𝔅(∞) and 𝔅(λ) the isomorphism classes of irreducible graded modules over R and Rλ, respectively. If aii ≠ 0 for all i ∈ I, we define the Uq(𝔤)-crystal structures on 𝔅(∞) and 𝔅(λ), and show that there exist crystal isomorphisms 𝔅(∞) ≃ B(∞) and 𝔅(λ) ≃ B(λ). One of the key ingredients of our approach is the perfect basis theory for generalized Kac–Moody algebras.
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.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
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".