Matroids motives, and a conjecture of Kontsevich

By P. Belkale, P. Brosnan. 2000

118 citations recorded by the source corpus.

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of Feynman amplitudes. Motivated by work of D. Kreimer and D. J. Broadhurst associating multiple zeta values to certain Feynman integrals, Kontsevich conjectured that the number of zeros of a Kirchhoff polynomial over the field with q elements is always a polynomial function of q. We show that this conjecture is false by relating the schemes defined by Kirchhoff polynomials to the representation spaces of matroids. Moreover, using Mnev's universality theorem, we show that these schemes essentially generate all arithmetic of schemes of finite type over the integers.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/5351424ce3b902edd51575daf8b8989e6bcab151

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Claude Duhr
  2. F. Brown
  3. John R. Rhodes
  4. Herbert Gangl
  5. Erik Panzer
  6. Falko Dulat
  7. L. Dixon
  8. Gudrun Heinrich

In Discrete Mathematics and Combinatorics

  1. Claude Duhr
  2. F. Brown
  3. John R. Rhodes
  4. Herbert Gangl
  5. L. Dixon
  6. Thomas Willwacher
  7. H. Johansson
  8. Alexander Ochirov

In Geometry and Topology

  1. Claude Duhr
  2. John R. Rhodes
  3. Herbert Gangl
  4. F. Brown
  5. Erik Panzer
  6. L. Dixon
  7. Falko Dulat
  8. Gudrun Heinrich

Citations in the corpus