The c_2 residue conjecture for primitive log-divergent graphs

Let GG be a graph with graph polynomial cPsiGcPsi_G, and let IGI_G denote its Feynman residue when GG is primitive and overall logarithmically divergent. For graphs with at least three vertices, let c2(G)c_2(G) be the point-counting invariant defined by

[XG]qc2(G)qq2(modq3),[X_G]_q \equiv c_2(G)_q q^2 \pmod{q^3},

where XGANGX_G\subset \mathbb{A}^{N_G} is the affine graph hypersurface defined by cPsiG=0cPsi_G=0.

The c2c_2 residue conjecture. If IG1=IG2I_{G_1}=I_{G_2} for two primitive log-divergent graphs G1G_1 and G2G_2, then

c2(G1)=c2(G2).c_2(G_1)=c_2(G_2).

This conjecture says that the c2c_2 invariant depends only on the Feynman residue whenever it is defined. It was verified for all graphs with at most 1414 edges, but its general status is not resolved in the supplied source.

Sources & referencesView supporting material

Primary source

Francis Brown, Oliver Schnetz and Karen Yeats, “Properties of c_2 invariants of Feynman graphs”, arXiv:1203.0188 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.