MétaCan
Menu
Back to cohort
Record W2007540911 · doi:10.1080/03081080600788234

Inertias of zero–nonzero patterns

2006· article· en· W2007540911 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.

Bibliographic record

VenueLinear and Multilinear Algebra · 2006
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsZero (linguistics)MathematicsSign (mathematics)CombinatoricsZero modeZero-point energyMatrix (chemical analysis)Zero orderMathematical analysisPhysicsMathematical physicsQuantum mechanicsApplied mathematics

Abstract

fetched live from OpenAlex

An n by n zero–nonzero pattern is a matrix with entries ∈{*, 0} where * denotes a nonzero real number. If allows all possible inertias, then is inertially arbitrary. It is shown that there exists a reducible n by n inertially arbitrary zero–nonzero pattern with 2n−1 nonzero entries for each n ≥ 6; and that for n = mt with t ≥ 6 and m ≥ 1, there exists a reducible n by n inertially arbitrary zero–nonzero pattern with 2n−m nonzero entries. These reducible inertially arbitrary zero–nonzero patterns are direct sums of irreducible zero–nonzero patterns, one of which is not inertially arbitrary. Furthermore, for these inertially arbitrary zero–nonzero patterns, it is shown that a superpattern need not be inertially arbitrary, these zero–nonzero patterns do not allow all possible spectra, and there are no inertially arbitrary sign patterns having these zero–nonzero patterns.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.368
Threshold uncertainty score0.572

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.005
GPT teacher head0.189
Teacher spread0.184 · 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