|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
An improved tree-graph bound | | Daniel Ueltschi
; | | Date: |
15 May 2017 | | 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. | | Source: | arXiv, 1705.5353 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER