The fundamental group of reductive Borel–Serre and Satake compactifications
Bibliographic record
Abstract
Let G be an almost simple, simply connected algebraic group defined over a number field k, and let S be a finite set of places of k including all infinite places.Let X be the product over v ∈ S of the symmetric spaces associated to G(kv ), when v is an infinite place, and the Bruhat-Tits buildings associated to G(kv), when v is a finite place.The main result of this paper is to compute explicitly the fundamental group of the reductive Borel-Serre compactification of Γ\X, where Γ is an S-arithmetic subgroup of G.In the case that Γ is neat, we show that this fundamental group is isomorphic to Γ/EΓ, where EΓ is the subgroup generated by the elements of Γ belonging to unipotent radicals of k-parabolic subgroups.Analogous computations of the fundamental group of the Satake compactifications are made.It is noteworthy that calculations of the congruence subgroup kernel C(S, G) yield similar results.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".