MétaCan
Menu
Back to cohort
Record W2951782741 · doi:10.48550/arxiv.1010.4957

Non-gatherable triples for classical affine root systems

2010· preprint· en· W2951782741 on OpenAlexfundno aff
Ivan Cherednik, Keith M. Schneider

Bibliographic record

VenuearXiv (Cornell University) · 2010
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsnot available
FundersDivision of Mathematical SciencesYork UniversityNational Science Foundation
KeywordsAffine transformationMathematicsAffine representationAffine coordinate systemPure mathematicsAffine hullAffine geometryAffine groupAffine plane (incidence geometry)Affine spaceAlgebraic numberAffine combinationAlgebra over a fieldDiscrete mathematicsAffine Lie algebraMathematical analysis

Abstract

fetched live from OpenAlex

This paper contains a complete description of minimal non-gatherable triangle triples in the lambda-sequences for the affine classical root systems and some claims for arbitrary (reduced) affine root systems. It continues our previous paper devoted to the non-affine case; interestingly, the affine theory clarifies the classification in the non-affine case. The lambda-sequences are associated with reduced decompositions (words) in affine Weyl groups. The existence of the non-gatherable triples is a combinatorial obstacle for using the technique of intertwiners in the theory of irreducible representations of the (double) affine Hecke algebras, complementary to their algebraic-geometric theory.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.553
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.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.118
GPT teacher head0.242
Teacher spread0.124 · 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
Published2010
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Combinatorial MathematicsFrench-language works237,207