Bibliographic record
Abstract
We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime [Formula: see text] and a finite abelian [Formula: see text]-group [Formula: see text], we consider the set of integers [Formula: see text] such that the Sylow [Formula: see text]-subgroup of the multiplicative group [Formula: see text] is isomorphic to [Formula: see text]. We show that the counting function of this set of integers is asymptotic to [Formula: see text] for explicit constants [Formula: see text] and [Formula: see text] depending on [Formula: see text] and [Formula: see text]. Second, we consider the set of integers [Formula: see text] such that the multiplicative group [Formula: see text] is “maximally non-cyclic”, that is, such that all of its prime-power subgroups are elementary groups. We show that the counting function of this set of integers is asymptotic to [Formula: see text] for an explicit constant [Formula: see text], where [Formula: see text] is Artin’s constant. As it turns out, both of these group-theoretic problems can be reduced to problems of counting integers with restrictions on their prime factors, allowing them to be addressed by classical techniques of analytic number theory.
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.003 | 0.018 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.012 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| 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".