Bibliographic record
Abstract
We consider the class ℛ of finitely generated toral relatively hyperbolic groups. We show that groups from ℛ are commutative transitive and generalize a theorem proved by Benjamin Baumslag in [3 Baumslag, B. (1967). Residually free groups. Prceedings of the London Mathematical Society 17(3):402–418.[Crossref] , [Google Scholar]] to this class. We also discuss two definitions of (fully) residually-𝒞 groups, i.e., the classical Definition 1.1 and a modified Definition 1.4. Building upon results obtained by Ol'shanskii [18 Ol'shanskii, A. Yu. (1993). On residualing homomorphisms and G-subgroups of hyperbolic groups. International Journal of Algebra Computation 3:365–409.[Crossref] , [Google Scholar]] and Osin [22 Osin, D. V. (2010). Small cancellations over relatively hyperbolic groups and embedding theorems. Annals of mathematics 172:1–39.[Crossref], [Web of Science ®] , [Google Scholar]], we prove the equivalence of the two definitions for 𝒞 = ℛ. This is a generalization of the similar result obtained by Ol'shanskii for 𝒞 being the class of torsion-free hyperbolic groups. Let Γ ∈ ℛ be non-abelian and non-elementary. Kharlampovich and Miasnikov proved in [14 Kharlampovich, O., Myasnikov, A. (2012). Limits of relatively hyperbolic groups and Lyndon's completions. Journal of the European Math. Soc. 14:659–680.[Crossref], [Web of Science ®] , [Google Scholar]] that a finitely generated fully residually-Γ group G embeds into an iterated extension of centralizers of Γ. We deduce from their theorem that every finitely generated fully residually-Γ group embeds into a group from ℛ. On the other hand, we give an example of a finitely generated torsion-free fully residually-ℋ group that does not embed into a group from ℛ; ℋ is the class of hyperbolic 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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".