Bibliographic record
Abstract
Let G be a group and G′ be its commutator subgroup. Denote by c(G) the minimal number such that every element of G′ can be expressed as a product of at most c(G) commutators. We find suitable bounds for c(G) when G is a free nilpotent by abelian group. Then we prove that c(G) is finite if G is a n-generator solvable group. And G has a nilpotent by abelian normal subgroup K of finite index. Moreover we have c(G) ≤ s(s + 1)/2 + 72n 2 + 47n, where s is the number of generators of K. We also prove that in a solvable group of finite Pruffer rank s every element of its commutator subgroup is equal to a product of at most s(s + 1)/2 + 72s 2 + 47s. And finally as a corollary of the above results we show that if A is a normal subgroup of a solvable group G such that G/A is a d-generator finite group. And A has finite Pruffer rank s. Then c(G) ≤ s(s + 1)/2 + 72(s 2 + n 2 ) + 47(s + n). The bounds we find are independent of the solvability length of the groups.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 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".