A K3 in ^4

From MaRDI portal
Publication:442755



Abstract: Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field Fq is a (quasi-) polynomial in q. Stembridge verified this for all graphs with leq12 edges, but in 2003 Belkale and Brosnan showed that the counting functions are of general type for large graphs. In this paper we give a sufficient combinatorial criterion for a graph to have polynomial point-counts, and construct some explicit counter-examples to Kontsevich's conjecture which are in phi4 theory. Their counting functions are given modulo pq2 (q=pn) by a modular form arising from a certain singular K3 surface.


The present paper concerns graph hypersurfaces and their number of points over finite fields. In 1997 Kontsevich conjectured that the number of points of graph hypersurfaces over a finite field \(\mathbb{F}_q\, (q=p^n, p \text{ a prime})\) is a polynomial or a quasi-polynomial in \(q\). This conjecture which was inspired by Feynman integral computations in quantum field theory, was verified by Stembridge for all graphs on at most 12 edges, but it tends to be false for large graphs by work of Belkale and Brosnan.NEWLINENEWLINEThe present paper provides a sufficient combinatorial criterion for a graph to have polynomial point-counts. It also constructs some explicit counterexamples to Kontsevich's conjecture which are actually arising from \(\phi^4\) theory. Their counting functions are related to the weight 3 Hecke eigenform NEWLINE\[NEWLINE (\eta(\tau)\eta(7\tau))^3 NEWLINE\]NEWLINE which is attached to the singular \(K3\) surface of discriminant \(-7\).




Cited in
(85)


Describes a project that uses

Uses Software






This page was built for publication: A \(K3\) in \(\phi^{4}\)

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