A K3 in
Jun 21, 2010Citations per year
Abstract: (arXiv)
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 \F_q is a (quasi-) polynomial in . Stembridge verified this for all graphs with 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 theory. Their counting functions are given modulo () by a modular form arising from a certain singular K3 surface.Note:
- Final version
- Feynman graph
- modular
- surface
- phi**n model: 4
- perturbation theory: higher-order
- mathematical methods
References(25)
Figures(13)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]