Configuration polynomials under contact equivalence

  • Graham Denham

    University of Western Ontario, London, Canada
  • Delphine Pol

    TU Kaiserslautern, Germany
  • Mathias Schulze

    TU Kaiserslautern, Germany
  • Uli Walther

    Purdue University, West Lafayette, USA
Configuration polynomials under contact equivalence cover
Download PDF

This article is published open access under our Subscribe to Open model.


Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated configuration hypersurface. In the contact equivalence class of any configuration polynomial we identify a polynomial with minimal number of variables; it is a configuration polynomial. This minimal number is bounded by , where is the rank of the underlying matroid. We show that the number of equivalence classes is finite exactly up to rank and list explicit normal forms for these classes.

Cite this article

Graham Denham, Delphine Pol, Mathias Schulze, Uli Walther, Configuration polynomials under contact equivalence. Ann. Inst. Henri Poincaré Comb. Phys. Interact. 9 (2022), no. 4, pp. 793–812

DOI 10.4171/AIHPD/154