MétaCan
Menu
Back to cohort
Record W4226460865 · doi:10.48550/arxiv.2203.01843

Duality via convolution of W-algebras

2022· preprint· en· W4226460865 on OpenAlexfundno aff
Thomas Creutzig, Andrew R. Linshaw, Shigenori Nakatsuka, Ryo Sato

Bibliographic record

VenuearXiv (Cornell University) · 2022
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Topics in Algebra
Canadian institutionsnot available
FundersJapan Society for the Promotion of ScienceNatural Sciences and Engineering Research Council of CanadaMinistry of Education, Culture, Sports, Science and TechnologyNational Science Foundation
KeywordsLanglands dual groupMathematicsDuality (order theory)Type (biology)Isomorphism (crystallography)Pure mathematicsLie algebraCombinatoricsCohomologyKernel (algebra)ConjectureGeneralizationMathematical analysis

Abstract

fetched live from OpenAlex

Feigin-Frenkel duality is the isomorphism between the principal $\mathcal{W}$-algebras of a simple Lie algebra $\mathfrak{g}$ and its Langlands dual Lie algebra ${}^L\mathfrak{g}$. A generalization of this duality to a larger family of $\mathcal{W}$-algebras called hook-type was recently conjectured by Gaiotto and Rapčák and proved by the first two authors. It says that the affine cosets of two different hook-type $\mathcal{W}$-algebras are isomorphic. A natural question is whether the duality between affine cosets can be enhanced to a duality between the full $\mathcal{W}$-algebras. There is a convolution operation that maps a hook-type $\mathcal{W}$-algebra $\mathcal{W}$ to a certain relative semi-infinite cohomology of $\mathcal{W}$ tensored with a suitable kernel VOA. The first two authors conjectured previously that this cohomology is isomorphic to the Feigin-Frenkel dual hook-type $\mathcal{W}$-algebra. Our main result is a proof of this conjecture.

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.001
metaresearch head score (Gemma)0.002
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.005
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.145
GPT teacher head0.253
Teacher spread0.108 · 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
GenreEmpirical

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

Citations4
Published2022
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Topics in AlgebraFrench-language works237,207