A few c₂ invariants of circulant graphs

From MaRDI portal
Publication:305096

DOI10.4310/CNTP.2016.V10.N1.A3zbMATH Open1345.81047arXiv1507.06974MaRDI QIDQ305096FDOQ305096

Karen Yeats

Publication date: 26 August 2016

Published in: Communications in Number Theory and Physics (Search for Journal in Brave)

Abstract: The c2 invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a 4-regular circulant graph with one vertex removed; call such a graph a decompletion of a circulant graph. The c2 invariant for the prime 2 is computed in the case of the decompletion of circulant graphs Cn(1,3) and C2k+2(1,k). For any prime p and for the previous two families of circulant graphs along with the further families Cn(1,4), Cn(1,5), Cn(1,6), Cn(2,3), Cn(2,4), Cn(2,5), and Cn(3,4), the same technique gives the c2 invariant of the decompletions as the solution to a finite system of recurrence equations.


Full work available at URL: https://arxiv.org/abs/1507.06974






Cited In (11)






This page was built for publication: A few \(c_2\) invariants of circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q305096)