Critical-window susceptibility conjecture for weakly self-avoiding walk on a torus
Critical-window susceptibility conjecture for weakly self-avoiding walk on a torus
Let be the torus susceptibility, let be the critical point, and let be the number of vertices in the torus. Critical-window susceptibility conjecture. Let and let be sufficiently small. For any , there is a constant , depending on , such that
Together with the known lower bound, this would show that the susceptibility is of order throughout the critical scaling window, in parallel with the complete graph. 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.