erdős #529
Let be the expected distance from the origin after taking random steps from the origin in (conditional on no self intersections) - that is, a self-avoiding walk. Is it true thatIs it true thatfor ?
Worked, still open.
geometry · open · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let (\mathrm{SAW}*n) be the uniform measure on $n$-step self‑avoiding walks (\omega=(\omega(0),\dots,\omega(n))) in (\mathbb Z^k) with (\omega(0)=0), and write (X_n=\omega(n)). Your quantity is [ d_k(n)=\mathbb E*{\mathrm{SAW}_n}\big[|X_n|*2\big]. ] Much of the rigorous literature instead studies the **root mean square…
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
self-avoiding walk · reference
Create a formalisation here · link
status
open