A Note on Cyclotomic Euler Systems and the Double Complex Method
Bibliographic record
Abstract
Abstract Let be a finite real abelian extension of ℚ. LetMbe an odd positive integer. For every squarefree positive integerrthe prime factors of which are congruent to 1 moduloMand split completely in , the corresponding Kolyvagin class satisfies a remarkable and crucial recursion which for each prime number ℓ dividingrdetermines the order of vanishing of κrat each place of above ℓ in terms of κr/ℓ. In this note we give the recursion a new and universal interpretation with the help of the double complex method introduced by Anderson and further developed by Das and Ouyang. Namely, we show that the recursion satis_ed by Kolyvagin classes is the specialization of a universal recursion independent of satisfied by universal Kolyvagin classes in the group cohomology of the universal ordinary distributionà laKubert tensored with ℤ=Mℤ. Further, we show by a method involving a variant of the diagonal shift operation introduced by Das that certain group cohomology classes belonging (up to sign) to a basis previously constructed by Ouyang also satisfy the universal recursion.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".