paper

An improved tree-graph bound

arXiv:1705.05353 · doi:10.4171/OWR/2017/8

Abstract

This report discusses the improved bound of the cluster expansion, recently proposed by Procacci and Yuhjtman (Lett. Math. Phys. 107, 31, 2017). Brydges and Helmuth noticed the relevance of Kruskal's algorithm, which allows to streamline and simplify the argument. These clarifications have proved useful in arXiv:1705.04385.

3 pages, 1 figure

References in corpus (1)

Cited by in corpus (3)