arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 2005.08181math.AGmath.CO
收藏

Configuration polynomials under contact equivalence

Graham Denham, Delphine Pol, Mathias Schulze, Uli Walther

英文摘要:

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+1\choose 2$, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑