The problem of determining the number of points of graph hyper-surfaces over a finite field Fq goes back to a question raised by Kontsevich in 1997, and is related to Feynman integral computations in quantum field theory. Stembridge showed that the point-count is polynomial in q for all graphs with ≤ 12 edges, but Belkale and Brosnan showed in 2003 that the… (More)


4 Figures and Tables

Slides referencing similar topics