Bibliographic record
Abstract
Abstract In this paper, we decompose $\overline {D}(a,M)$ into modular and mock modular parts, so that it gives as a straightforward consequencethe celebrated results of Bringmann and Lovejoy on Maass forms. Let $\overline {p}(n)$ be the number of partitions of n and $\overline {N}(a,M,n)$ be the number of overpartitions of n with rank congruent to a modulo M. Motivated by Hickerson and Mortenson, we find and prove a general formula for Dyson’s ranks by considering the deviation of the ranks from the average: $$ \begin{align*} \overline{D}(a,M) &=\sum\limits_{n=0}^{\infty}\Big(\overline{N}(a,M,n) -\frac{\overline{p}(n)}{M}\Big)q^{n}. \end{align*} $$ Based on Appell–Lerch sum properties and universal mock theta functions, we obtain the stronger version of the results of Bringmann and Lovejoy.
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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".