Counting points on varieties over finite fields related to a conjecture of Kontsevich

We describe a characteristic-free algorithm for “reducing” an algebraic variety defined by the vanishing of a set of integer polynomials. In very special cases, the algorithm can be used to decide whether the number of points on a variety, as the ground field varies over finite fields, is a polynomial function of the size of the field. The algorithm is then used to investigate a conjecture of Kontsevich regarding the number of points on a variety associated with the set of spanning trees of any graph. We also prove several theorems describing properties of a (hypothetical) minimal counterexample to the conjecture, and produce counterexamples to some related conjectures.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/43265/1/26_2005_Article_BF01608531.pd