Primary stranded-graph bound for traceless Hermitian matrix models

Let G\mathcal G be a connected vacuum Feynman graph, let α(G)\alpha(\mathcal G) denote its large-DD exponent, and let PGP_{\mathcal G} be the associated polynomial. Write valPG\operatorname{val}P_{\mathcal G} for the valuation of this polynomial. Primary stranded-graph bound. One has

α(G)valPG.\alpha(\mathcal G)\leq \operatorname{val}P_{\mathcal G}.

The bound is proposed as a graph-by-graph control of the cancellations induced by tracelessness and is intended to support the finiteness and linear growth of η(h)\eta(h). Its general validity is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Sylvain Carrozza, Frank Ferrari, Adrian Tanasa and Guillaume Valette, “On the large D expansion of Hermitian multi-matrix models”, arXiv:2003.04152 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.