MétaCan
Menu
Back to cohort
Record W4416916517 · doi:10.13001/ela.2025.9507

Combinatorial considerations for the number of distinct eigenvalues of a matrix

2025· article· W4416916517 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueElectronic Journal of Linear Algebra · 2025
Typearticle
Language
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsNorth York General HospitalRedeemer UniversityThe Scarborough HospitalUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsEigenvalues and eigenvectorsDigraphSequence (biology)Matrix (chemical analysis)InverseBinary numberSpectrum of a matrixSpectrum (functional analysis)

Abstract

fetched live from OpenAlex

We address the inverse eigenvalue problem of determining the potential number of distinct eigenvalues of a real matrix based on the zero-nonzero structure of the matrix. In particular, a nonzero pattern $\mathcal{A}$ is a matrix with entries in $\{*,0\}$. The allow sequence of distinct eigenvalues for an $n\times n$ pattern $\mathcal{A}$ is a binary vector of length $n$ with the $k$th entry equal to $1$ if and only if there exists a real matrix with pattern $\mathcal{A}$ having exactly $k$ distinct eigenvalues. We develop digraph techniques for identifying properties of the allow sequence and give some general results for cycle patterns. We obtain a classification for all the star patterns according to their allow sequence. We also determine the allow sequence for each $n\times n$ irreducible pattern with $n\leq 4$.

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.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation 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: none
Teacher disagreement score0.905
Threshold uncertainty score0.774

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.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.012
GPT teacher head0.301
Teacher spread0.289 · 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