MétaCan
Menu
Back to cohort
Record W3206898017 · doi:10.26493/1855-3974.2724.83d

The search for small association schemes with noncyclotomic eigenvalues

2022· article· en· W3206898017 on OpenAlexafffund
Allen Herman, Roghayeh Maleki

Bibliographic record

VenueArs Mathematica Contemporanea · 2022
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Regina
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsAssociation schemeEigenvalues and eigenvectorsRank (graph theory)Commutative propertyAlgebraic numberTable (database)Pure mathematicsAlgebra over a fieldDiscrete mathematicsCombinatoricsMathematical analysis

Abstract

fetched live from OpenAlex

In this article we determine feasible parameter sets for (what could potentially be) commutative association schemes with noncyclotomic eigenvalues that are of smallest possible rank and order. A feasible parameter set for a commutative association scheme corresponds to a standard integral table algebra with integral multiplicities that satisfies all of the parameter restrictions known to hold for association schemes. For each rank and involution type, we generate an algebraic set for which any suitable integral solution corresponds to a standard integral table algebra with integral multiplicities, and then try to find the smallest suitable solution. The main results of this paper show the eigenvalues of association schemes of rank 4 and nonsymmetric association schemes of rank 5 will always be cyclotomic. In the rank 5 cases, the results rely on calculations done by computer for Gröbner bases or for bases of rational vector spaces spanned by polynomials. We give several examples of feasible parameter sets for small symmetric association schemes of rank 5 that have noncyclotomic eigenvalues.

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.007
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.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.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.024
GPT teacher head0.236
Teacher spread0.212 · 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

Citations1
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueArs Mathematica ContemporaneaSame topicCoding theory and cryptographyFrench-language works237,207