Configuration polynomials under contact equivalence

DOI10.4171/AIHPD/154MaRDI QIDQ6340860arXivFDO

Authors Graham Denham, Delphine Pol, Mathias Schulze, Uli Walther

Publication date 17 May 2020

Published in arXiv

Full work available at URL https://doi.org/10.4171/AIHPD/154

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinantal varieties (14M12) Configurations and arrangements of linear subspaces (14N20) Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30)

arXiv classification

math.AGmath.CO

Abstract: 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 $r+1choose2$, where $r$ is the rank of the underlying matroid. We show that the number of equivalence classes is finite exactly up to rank $3$ and list explicit normal forms for these classes.

This page was built for publication: Configuration polynomials under contact equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340860)