MétaCan
Menu
Back to cohort
Record W1972975178 · doi:10.1142/s0218196703001316

PRODUCTS OF COMMUTATORS IN FREE GROUPS

2003· article· en· W1972975178 on OpenAlexaff
Mehri Akhavan-Malayeri, A. H. Rhemtulla

Bibliographic record

VenueInternational Journal of Algebra and Computation · 2003
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMathematicsRank (graph theory)Word (group theory)CombinatoricsProduct (mathematics)Free productFree groupAlgebraic numberInfinityGroup (periodic table)Mathematical proofDiscrete mathematicsAlgebra over a fieldPure mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

Let F be the free group of rank 2, generated by x and y, and let w(x, y) ∈ F′ be a non-trivial word. We give elementary algebraic proofs and algorithms to (1) express [x, y] n as a product of [n/2] + 1 commutators and show this is the best possible; (2) show that (w(x, y)) 2 cannot be written as one w-word and if g ≠ 1 ∈ w(F) then show that the minimal number of w-words required to express g n as their product tends to infinity with n. Other results for free groups of higher rank are also presented.

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 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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.169
Threshold uncertainty score0.209

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.001
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.009
GPT teacher head0.245
Teacher spread0.236 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Quick stats

Citations0
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Algebra and ComputationSame topicsemigroups and automata theoryFrench-language works237,207