Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
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.
Bibliographic record
Abstract
Abstract Associated to a graph G is a set 𝒮( G ) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen. If G has n vertices, then the multiplicities of the eigenvalues of any matrix in 𝒮 ( G ) partition n ; this is called a multiplicity partition. We study graphs for which a multiplicity partition with only two integers is possible. The graphs G for which there is a matrix in 𝒮 ( G ) with partitions [ n − 2, 2] have been characterized. We find families of graphs G for which there is a matrix in 𝒮 ( G ) with multiplicity partition [ n − k , k ] for k ≥ 2. We focus on generalizations of the complete multipartite graphs. We provide some methods to construct families of graphs with given multiplicity partitions starting from smaller such graphs. We also give constructions for graphs with matrix in 𝒮 ( G ) with multiplicity partition [ n − k , k ] to show the complexities of characterizing these graphs.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it