The Ariki–Koike algebras and Rogers–Ramanujan type partitions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Ariki and Mathas (Math Z 233(3):601–623, 2000) showed that the simple modules of the Ariki–Koike algebras $$\mathcal {H}_{\mathbb {C},v;Q_1,\ldots , Q_m}\big (G(m, 1, n)\big )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>H</mml:mi> <mml:mrow> <mml:mi>C</mml:mi> <mml:mo>,</mml:mo> <mml:mi>v</mml:mi> <mml:mo>;</mml:mo> <mml:msub> <mml:mi>Q</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>Q</mml:mi> <mml:mi>m</mml:mi> </mml:msub> </mml:mrow> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> </mml:mrow> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>m</mml:mi> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> (when the parameters are roots of unity and $$v \ne 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>v</mml:mi> <mml:mo>≠</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> ) are labeled by the so-called Kleshchev multipartitions. This together with Ariki’s categorification theorem enabled Ariki and Mathas to obtain the generating function for the number of Kleshchev multipartitions by making use of the Weyl–Kac character formula. In this paper, we revisit their generating function relation for the $$v=-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>v</mml:mi> <mml:mo>=</mml:mo> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> case. In particular, this $$v=-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>v</mml:mi> <mml:mo>=</mml:mo> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> scenario is of special interest as the corresponding Kleshchev multipartitions are closely tied with generalized Rogers–Ramanujan type partitions when $$Q_1=\cdots =Q_a=-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>=</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>=</mml:mo> <mml:msub> <mml:mi>Q</mml:mi> <mml:mi>a</mml:mi> </mml:msub> <mml:mo>=</mml:mo> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> and $$Q_{a+1}=\cdots =Q_m =1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mrow> <mml:mi>a</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> <mml:mo>=</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo>=</mml:mo> <mml:msub> <mml:mi>Q</mml:mi> <mml:mi>m</mml:mi> </mml:msub> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . Based on this connection, we provide an analytic proof of the result of Ariki and Mathas for the above choice of parameters. Our second objective is to investigate simple modules of the Ariki–Koike algebra in a fixed block, which are, as widely known, labeled by the Kleshchev multiparitions with a fixed partition residue statistic. This partition statistic is also studied in the works of Berkovich, Garvan, and Uncu. Employing their results, we provide two bivariate generating function identities for the $$m=2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>m</mml:mi> <mml:mo>=</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> scenario.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it