MétaCan
Menu
Back to cohort
Record W4413891905 · doi:10.5802/alco.433

Cluster monomials in graph Laurent phenomenon algebras

2025· article· en· W4413891905 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAlgebraic Combinatorics · 2025
Typearticle
Languageen
FieldMathematics
TopicAlgebraic structures and combinatorial models
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaHaverford CollegeUniversity of MinnesotaHarvard UniversityNational Science Foundation
KeywordsPhenomenonCluster algebraMonomialMathematicsGraphCluster (spacecraft)Laurent polynomialCombinatoricsPure mathematicsComputer sciencePhysicsEpistemologyPhilosophyQuantum mechanicsQuantumProgramming language

Abstract

fetched live from OpenAlex

Laurent phenomenon algebras, first introduced by Lam and Pylyavskyy, are a generalization of cluster algebras that still possess many salient features of cluster algebras. Graph Laurent phenomenon algebras, defined by Lam and Pylyavskyy, are a subclass of Laurent phenomenon algebras whose structure is given by the data of a directed graph. In this paper, we prove that the cluster monomials of a graph Laurent phenomenon algebra form a linear basis, as conjectured by Lam and Pylyavskyy and analogous to a result for cluster algebras by Caldero and Keller. We also prove that, if the graph is a bidirected tree, the coefficients of the expansion of any monomial in terms of cluster monomials are nonnegative.

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.

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.001
metaresearch head score (Gemma)0.000
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: Empirical
Teacher disagreement score0.023
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.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.019
GPT teacher head0.291
Teacher spread0.272 · 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