REVIEW 2 cited by
Period Preserving Properties of an Invariant from the Permanent of Signed Incidence Matrices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
A 4-point Feynman diagram in scalar $\phi^4$ theory is represented by a graph $G$ which is obtained from a connected 4-regular graph by deleting a vertex. The associated Feynman integral gives a quantity called the period of $G$ which is invariant under a number of meaningful graph operations - namely, planar duality, the Schnetz twist, and it also does not depend on the choice of vertex which was deleted to form $G$. In this article we study a graph invariant we call the graph permanent, which was implicitly introduced in a paper by Alon, Linial and Meshulam. The graph permanent applies to any graph $G = (V,E)$ for which $|E|$ is a multiple of $|V| - 1$ (so in particular to graphs obtained from a 4-regular graph by removing a vertex). We prove that the graph permanent, like the period, is invariant under planar duality and the Schnetz twist when these are valid operations, and we show that when $G$ is obtained from a $2k$-regular graph by deleting a vertex, the graph permanent does not depend on the choice of deleted vertex.
Forward citations
Cited by 2 Pith papers
-
Hepp's bound for Feynman graphs and matroids
The Hepp bound, a rational matroid invariant from tropicalizing the Feynman period integral, provably respects all known graph period symmetries and correlates strongly with actual periods.
-
Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$
For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.
Discussion (0). Continue with ORCID to comment.