MétaCan
Menu
Back to cohort
Record W7008312688

Braid groups and Baxter polynomials

2024· dissertation· en· W7008312688 on OpenAlexfundno aff

Bibliographic record

VenueUniversity Library (University of Saskatchewan) · 2024
Typedissertation
Languageen
FieldMathematics
TopicAlgebraic structures and combinatorial models
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsYangianBraid groupSubalgebraAction (physics)Group (periodic table)Tensor productAlgebra over a fieldHopf algebra
DOInot available

Abstract

fetched live from OpenAlex

It is well known that the braid group of a simple Lie algebra acts on its integrable representations via products of exponentials of its Chevalley generators. In particular, the Yangian is an integrable representation, so there is an action of the braid group on this space. We show that modifying this action induces an action of the braid group on a certain commutative subalgebra of the Yangian by Hopf algebra automorphisms. By dualizing this modified action, we recover an action of the braid group on tuples of rational functions defined in the work of Y. Tan. Using this dual action, we prove a conjecture of S. Gautam and C. Wendlandt that the two sufficient conditions for the tensor product of finite-dimensional irreducible representations of the Yangian to be cyclic are identical. One of these conditions involves the aforementioned action of the braid group on rational functions, and the other involves roots of the Baxter polynomials, which have many interesting properties and ties to mathematical physics.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
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.135
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.000

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.009
GPT teacher head0.195
Teacher spread0.186 · 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 teacher head, not a consensus.

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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueUniversity Library (University of Saskatchewan)Same topicAlgebraic structures and combinatorial modelsFrench-language works237,207