Ottawa Lectures on Admissible Representations of Reductive 𝑝-adic Groups
Bibliographic record
Abstract
Ottawa Lectures offers researchers and graduate students a rare introduction to some of the major modern themes in the representation theory of p-adic groups: the classification and construction of their (complex) admissible representations, the calculation of their characters, and the realization of the celebrated local Langlands correspondence. Recent years have seen significant and rapid progress made toward each of these goals; the purpose of this book is to help bridge the gap from the classical literature to the forefront of research. The first part of this volume is devoted to the tools and techniques used to classify and construct smooth representations of p-adic groups: the Bernstein decomposition, Bruhat - Tits theory and filtrations of subgroups, and an overview of J.K. Yu's construction of supercuspidal representations, together with J.L. Kim's proof that it is exhaustive. The second part begins with a historical overview of character computations and continues with an introduction to motivic integration. The volume concludes, in the third part, with an introduction to the local Langlands programme and a proof of the local Langlands correspondence for algebraic tori. The chapters, written by leaders in this field, arose from lecture notes of mini-courses delivered at workshops held at the University of Ottawa in 2004 and 2007.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.019 | 0.005 |
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".