×

A study on prefixes of \(c_2\) invariants. (English) Zbl 1442.81029

Chapoton, Frédéric (ed.) et al., Algebraic combinatorics, resurgence, moulds and applications (CARMA). Volume 2. Berlin: European Mathematical Society (EMS). IRMA Lect. Math. Theor. Phys. 32, 367-383 (2020).
Summary: This paper begins by reviewing recent progress that has been made by taking a combinatorial perspective on the \(c_2\) invariant, an arithmetic graph invariant with connections to Feynman integrals. Then it proceeds to report on some recent calculations of \(c_2\) invariants for two families of circulant graphs at small primes. These calculations support the idea that all possible finite sequences appear as initial segments of \(c_2\) invariants, in contrast to their apparent sparsity on small graphs.
For the entire collection see [Zbl 1437.05004].

MSC:

81Q30 Feynman integrals and graphs; applications of algebraic topology and algebraic geometry
05C38 Paths and cycles

References:

[1] J. Ax, Zeroes of polynomials over finite fields, Am. J. Math. 86(2) (1964), 255-261. · Zbl 0121.02003
[2] F. Brown, On the periods of some Feynman integrals, arXiv:0910.0114.
[3] F. Brown and O. Schnetz,A K3 in4,Duke Math. J. 161(10) (2012), 1817-1862. arXiv:1006.4064. · Zbl 1253.14024
[4] F. Brown and O. Schnetz, Modular forms in quantum field theory, Commun. Number Theor. Phys. 7(2) (2013), 293-325, arXiv:1304.5342. · Zbl 1290.81083
[5] F. Brown and O. Schnetz, Single-valued multiple polylogarithms and a proof of the zig zag conjecture, J. Number Theor. 148 (2015), 478-506, arXiv:1208.1890. · Zbl 1395.11115
[6] F. Brown and K. Yeats, Spanning forest polynomials and the transcendental weight of Feynman graphs, Commun. Math. Phys. 301(2) (2011), 357-382, arXiv:0910.5429. · Zbl 1223.05019
[7] S. Chaiken, A combinatorial proof of the all minors matrix tree theorem, SIAM J. Alg. Disc. Meth., 3(3) (1982), 319-329. · Zbl 0495.05018
[8] T.-P. Cheng and L.-F. Li, Gauge theory of elementary particle physics, Oxford University Press, 1984.
[9] W. Chorney and K. Yeats,c2invariants of recursive families of graphs, Ann. Inst. Henri Poincaré Comb. Phys. Interact., (to appear), arXiv:1701.01208. · Zbl 1414.05152
[10] D. J. Gross. Applications of the renormalization group to high-energy physics. In Methods in field theory (R. Balian and J. Zinn-Justin, eds.), North-Holland, Les Houches, 1975, 141-250.
[11] J. M. Gracia-Bondia, K. Ebrahimi-Fard, and F. Patras, A Lie theoretic approach to renormalization, Commun. Math. Phys. 276(2) (2007), 519-549, arXiv:hep-th/0609035. · Zbl 1136.81395
[12] M. Noy and A. Ribó, Recursively constructible families of graphs, Adv. Appl. Math. 32(1) (2004), 350-363. · Zbl 1041.05050
[13] O. Schnetz, Quantum periods: A census of4-transcendentals, Commun. Number Theor. Phys. 4(1) (2010), 1-48, arXiv:0801.2856. · Zbl 1202.81160
[14] O. Schnetz, Quantum field theory overFq, Electron. J. Combin. 18 (2011), arXiv:0909.0905. · Zbl 1217.05110
[15] N. J. A.Sloane,Theon-lineencyclopediaofintegersequences. www.research.att.com/ njas/sequences/, 2008.
[16] M. E. Sweedler, Hopf Algebras. W. A. Benjamin, 1969. A study on prefixes ofc2invariants383 · Zbl 0194.32901
[17] W. D. van Suijlekom, Renormalization of gauge fields: A Hopf algebra approach, Commun. Math. Phys. 276 (2007), 773-798, arXiv:hep-th/0610137. · Zbl 1194.81165
[18] A. Vlasev and K. Yeats, A four-vertex, quadratic, spanning forest polynomial identity, Electron. J. Linear Algebra 23 (2012), 923-941, arXiv:1106.2869. · Zbl 1282.05071
[19] K. Yeats, A fewc2invariants of circulant graphs, Commun. Number Theory Phys. 10(1) (2016), 63-86, arXiv:1507.06974. · Zbl 1345.81047
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.