Quivers with relations arising from clusters (𝐴_{𝑛} case)
Bibliographic record
Abstract
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper U"> <mml:semantics> <mml:mi>U</mml:mi> <mml:annotation encoding="application/x-tex">U</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a cluster algebra of type <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A Subscript n"> <mml:semantics> <mml:msub> <mml:mi>A</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">A_n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We associate to each cluster <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C"> <mml:semantics> <mml:mi>C</mml:mi> <mml:annotation encoding="application/x-tex">C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper U"> <mml:semantics> <mml:mi>U</mml:mi> <mml:annotation encoding="application/x-tex">U</mml:annotation> </mml:semantics> </mml:math> </inline-formula> an abelian category <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper C Subscript upper C"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">C</mml:mi> </mml:mrow> <mml:mi>C</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathcal {C}_C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that the indecomposable objects of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper C Subscript upper C"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">C</mml:mi> </mml:mrow> <mml:mi>C</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathcal {C}_C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are in natural correspondence with the cluster variables of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper U"> <mml:semantics> <mml:mi>U</mml:mi> <mml:annotation encoding="application/x-tex">U</mml:annotation> </mml:semantics> </mml:math> </inline-formula> which are not in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C"> <mml:semantics> <mml:mi>C</mml:mi> <mml:annotation encoding="application/x-tex">C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We give an algebraic realization and a geometric realization of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper C Subscript upper C"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">C</mml:mi> </mml:mrow> <mml:mi>C</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathcal {C}_C</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . Then, we generalize the “denominator theorem” of Fomin and Zelevinsky to any cluster.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.003 | 0.003 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.010 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".