MétaCan
Menu
Back to cohort
Record W2177087411 · doi:10.1142/s0219199719500019

Simple current extensions beyond semi-simplicity

2019· article· en· W2177087411 on OpenAlexafffund
Thomas Creutzig, Shashank Kanade, Andrew R. Linshaw

Bibliographic record

VenueCommunications in Contemporary Mathematics · 2019
Typearticle
Languageen
FieldMathematics
TopicAlgebraic structures and combinatorial models
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of CanadaSimons Foundation
KeywordsMathematicsSimple (philosophy)Indecomposable moduleVertex (graph theory)Pure mathematicsDimension (graph theory)Categorical variableConformal mapParameterized complexityAlgebra over a fieldDiscrete mathematicsCombinatoricsMathematical analysisGraph

Abstract

fetched live from OpenAlex

Let [Formula: see text] be a simple vertex operator algebra (VOA) and consider a representation category of [Formula: see text] that is a vertex tensor category in the sense of Huang–Lepowsky. In particular, this category is a braided tensor category. Let [Formula: see text] be an object in this category that is a simple current of order two of either integer or half-integer conformal dimension. We prove that [Formula: see text] is either a VOA or a super VOA. If the representation category of [Formula: see text] is in addition ribbon, then the categorical dimension of [Formula: see text] decides this parity question. Combining with Carnahan’s work, we extend this result to simple currents of arbitrary order. Our next result is a simple sufficient criterion for lifting indecomposable objects that only depends on conformal dimensions. Several examples of simple current extensions that are [Formula: see text]-cofinite and non-rational are then given and induced modules listed.

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.009
Threshold uncertainty score0.029

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.000
Science and technology studies0.0010.003
Scholarly communication0.0020.007
Open science0.0010.003
Research integrity0.0010.001
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.152
GPT teacher head0.385
Teacher spread0.233 · 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

Citations67
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueCommunications in Contemporary MathematicsSame topicAlgebraic structures and combinatorial modelsFrench-language works237,207