Gaussian upper-bound conjecture for walk counts on a high-dimensional torus
Gaussian upper-bound conjecture for walk counts on a high-dimensional torus
Let be the -step weakly self-avoiding-walk count on the torus, let be the growth constant on , and let be the number of vertices in the torus. Gaussian upper-bound conjecture. Let and let . There exist , depending on , such that, for all ,
The conjecture is intended to describe the onset of finite-volume effects at lengths of order and is presented as an upper bound paralleling the complete-graph behaviour. The supplied text gives no resolution.
Sources & referencesView supporting material
Primary source
Emmanuel Michta and Gordon Slade, “Weakly self-avoiding walk on a high-dimensional torus”, arXiv:2107.14170 (2022).
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
Sign in to submit a solution.
No solutions have been posted yet.