MétaCan
Menu
Back to cohort
Record W3105213079 · doi:10.48550/arxiv.2011.08274

A simple way to compute structure constants of semi-simple Lie algebras

2020· preprint· en· W3105213079 on OpenAlexaff
Bill Casselman

Bibliographic record

VenuearXiv (Cornell University) · 2020
Typepreprint
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsSimple (philosophy)Lie algebraMathematicsPure mathematicsAlgebra over a fieldPhilosophyEpistemology

Abstract

fetched live from OpenAlex

The standard way to compute the structure constants of semi-simple Lie algebras involves the additive structure of the roots. In earlier work, I described how ideas of Jacques Tits could be applied to do this by using the structure of the Weyl group. In this work, I explain how to combine some of the earlier ideas with some suggestions of Kottwitz to present a very simple algorithm which comes close to constructing a canonical basis of the Lie algebra. Unfortunately, unlike previous methods, it does not work for arbitrary Kac-Moody algebra.

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.004
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: Methods
Teacher disagreement score0.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0100.003

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.161
GPT teacher head0.262
Teacher spread0.101 · 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

Citations2
Published2020
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicFinite Group Theory ResearchFrench-language works237,207