Feynman symmetries of the Martin and \(c_2\) invariants of regular graphs
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
For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. We prove that this sequence counts spanning tree partitions and thus constitutes the diagonal coefficients of powers of the Kirchhoff polynomial. We also prove that this sequence respects all known symmetries of Feynman period integrals in quantum field theory. We show that other quantities with this property, the \(c_2\) invariant and the extended graph permanent, are essentially determined by our new sequence. This proves the completion conjecture for the \(c_2\) invariant at all primes, and also that it is fixed under twists. We conjecture that our invariant is perfect: Two Feynman periods are equal, if and only if, their Martin sequences are equal.Mathematics Subject Classifications: 81Q30, 05C70, 05C45Keywords: Martin polynomial, transitions, spanning trees, point counts, Feynman integrals, integer sequences, permanent, Prüfer sequence
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.001 |
| 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