MétaCan
Menu
Back to cohort
Record W2626745001 · doi:10.1090/ert/536

A quantum Mirković-Vybornov isomorphism

2020· preprint· en· W2626745001 on OpenAlexafffund
Ben Webster, Alex Weekes, Oded Yacobi

Bibliographic record

VenueRepresentation Theory of the American Mathematical Society · 2020
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Algebra and Geometry
Canadian institutionsUniversity of British ColumbiaPerimeter InstituteUniversity of Waterloo
FundersAustralian Research CouncilNatural Sciences and Engineering Research Council of CanadaDivision of Mathematical SciencesNational Science FoundationGovernment of CanadaAlfred P. Sloan FoundationUniversity of SydneyInstitut Périmètre de physique théoriqueInnovation, Science and Economic Development Canada
KeywordsYangianMathematicsSubalgebraNilpotentIsomorphism (crystallography)Pure mathematicsGrassmannianIsomorphism extension theoremQuantumAlgebra over a fieldPhysics

Abstract

fetched live from OpenAlex

We present a quantization of an isomorphism of Mirković and Vybornov which relates the intersection of a Slodowy slice and a nilpotent orbit closure in g l N \mathfrak {gl}_N to a slice between spherical Schubert varieties in the affine Grassmannian of P G L n PGL_n (with weights encoded by the Jordan types of the nilpotent orbits). A quantization of the former variety is provided by a parabolic W-algebra and of the latter by a truncated shifted Yangian. Building on earlier work of Brundan and Kleshchev, we define an explicit isomorphism between these non-commutative algebras and show that its classical limit is a variation of the original isomorphism of Mirković and Vybornov. As a corollary, we deduce that the W-algebra is free as a left (or right) module over its Gelfand-Tsetlin subalgebra, as conjectured by Futorny, Molev, and Ovsienko.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0020.002
Scholarly communication0.0020.003
Open science0.0000.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0090.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.

Opus teacher head0.064
GPT teacher head0.357
Teacher spread0.293 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

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
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueRepresentation Theory of the American Mathematical SocietySame topicAdvanced Algebra and GeometryFrench-language works237,207