On strongly regular designs admitting fusion to strongly regular decomposition
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 A strongly regular decomposition of a strongly regular graph is a partition of the vertex set into two parts on which the induced subgraphs are strongly regular, or cliques or cocliques. Strongly regular designs (srd's) as defined by D. G. Higman are coherent configurations of rank 10 with two fibers in which the homogeneous configuration on each fiber is a strongly regular graph. Haemers and Higman proved the equivalence between strongly regular decompositions, excluding special cases, and srd's with certain parameter conditions. Here we obtain this result by examining the srd's that admit a fusion to a strongly regular graph on the full vertex set. We derive equivalent conditions to Theorem 2.8 of Haemers and Higman by elementary methods. Incorporating recent works of Hanaki and Klin and Reichard, a table of feasible parameter sets for this class of srd's is presented along with a discussion of known constructions. In two cases, nonexistence is observed due to nonexistence of the strongly regular graph obtained through fusion. One of these is also ruled out by Hobart's generalized Krein conditions, applied to srd's. As strongly regular decompositions of the complete graph have sparked interest with recent papers we observe that in our situation this occurs only when the constituent graphs are also complete and the design is trivial.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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