MétaCan
Menu
Back to cohort
Record W2075351895 · doi:10.1142/s0218196700000364

POLYNOMIAL INDEX GROWTH GROUPS

2000· article· en· W2075351895 on OpenAlex

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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Algebra and Computation · 2000
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topics in Algebra
Canadian institutionsnot available
FundersHebrew University of JerusalemUniversity of AlbertaBG Group
KeywordsMathematicsPolynomialExponentConjectureIndex (typography)Simple (philosophy)Bounded functionCombinatoricsOrder (exchange)Classification of finite simple groupsConstant (computer programming)Pure mathematicsDiscrete mathematicsGroup of Lie typeMathematical analysisGroup theory

Abstract

fetched live from OpenAlex

We show that the order of a finite simple of Lie type is bounded by a small constant power of its exponent. This confirms, in a strengthened form, a conjecture of Vaughan-Lee and Zel'manov on the order and exponent of almost simple groups. We also obtain various structural restrictions on groups of polynomial index growth. Combining the above results we construct finitely generated residually finite groups of polynomial index growth which are neither linear nor boundedly generated. This answers questions of Segal and Platonov–Rapinchuk respectively. A further question of Platonov–Rapinchuk concerning a weakened polynomial index growth assumption is also answered.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.686
Threshold uncertainty score0.341

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.019
GPT teacher head0.312
Teacher spread0.293 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it