Clustering bound for truncated correlations in unbounded spin systems
Let denote either spin field, let be sufficiently small, and let be a finite volume. For even , write for the truncated -point correlation, with each an arbitrary assignment of the available sharp symbols. Clustering bound conjecture. There exists a constant such that, for small enough, every even integer , every finite volume , and every assignment of the symbols satisfy
This conjecture would provide a uniform -clustering estimate with factorial growth in the number of fields, extending the tree-level bound to the full truncated correlations. The supplied text does not state whether the conjecture has been proved or disproved.
References
- Abdelmalek Abdesselam, Aldo Procacci and Benedetto Scoppola, “Clustering Bounds on N-Point Correlations for Unbounded Spin Systems”, arXiv:0901.4756 (2009).
Progress summary
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.