Bibliographic record
Abstract
Abstract Let "Equation missing"<!-- image only, no MathML or LaTex --> and "Equation missing"<!-- image only, no MathML or LaTex --> be "Equation missing"<!-- image only, no MathML or LaTex --> complex matrices, and consider the densely defined map "Equation missing"<!-- image only, no MathML or LaTex --> on "Equation missing"<!-- image only, no MathML or LaTex --> matrices. Its fixed points form a graph, which is generically (in terms of "Equation missing"<!-- image only, no MathML or LaTex -->) nonempty, and is generically the Johnson graph "Equation missing"<!-- image only, no MathML or LaTex -->; in the nongeneric case, either it is a retract of the Johnson graph, or there is a topological continuum of fixed points. Criteria for the presence of attractive or repulsive fixed points are obtained. If "Equation missing"<!-- image only, no MathML or LaTex --> and "Equation missing"<!-- image only, no MathML or LaTex --> are entrywise nonnegative and "Equation missing"<!-- image only, no MathML or LaTex --> is irreducible, then there are at most two nonnegative fixed points; if there are two, one is attractive, the other has a limited version of repulsiveness; if there is only one, this fixed point has a flow-through property. This leads to a numerical invariant for nonnegative matrices. Commuting pairs of these maps are classified by representations of a naturally appearing (discrete) group. Special cases (e.g., "Equation missing"<!-- image only, no MathML or LaTex --> is in the radical of the algebra generated by "Equation missing"<!-- image only, no MathML or LaTex --> and "Equation missing"<!-- image only, no MathML or LaTex -->) are discussed in detail. For invertible size two matrices, a fixed point exists for all choices of "Equation missing"<!-- image only, no MathML or LaTex --> if and only if "Equation missing"<!-- image only, no MathML or LaTex --> has distinct eigenvalues, but this fails for larger sizes. Many of the problems derived from the determination of harmonic functions on a class of Markov chains.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.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.
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".