Square lattice connective constant remains unsolved — ripe for AI, argues mathematician
tak3sh8 · x · 2026-10-16
tak3sh8 notes that the connective constant of the square lattice (self-avoiding walks) still has no known value, calling it ripe for AI attack. He adds that physicists had guessed the hexagonal lattice value decades ago (by at least 1982) before Hugo Duminil proved it in 2010, while for the square lattice not even a good heuristic guess exists.
Related event: Unsolved lattice connective constant seen as ideal problem for AI(2 posts)→
More from Research
- 200 chess games suggest in-context learning doesn't work yet, experimenter says — akbirthko · 2026-10-16
- Mosaic: multi-session agentic RL with hierarchical advantage estimation — LARK-Lab · 2026-10-16
- Meituan LongCat's WorldCast benchmark: GPT-Image-2.5 tops at 72.8, open-source lags — meituan-longcat · 2026-10-16
- Recursive Environment Scaling tanks six models' success rates by 57–77 points — Lingxiao Jing · 2026-10-16
- Harvard's MPT: decentralized agent swarms learn self-orchestration via bidding — Harvard · 2026-10-16
- MIT Biology and Schwarzman College hiring tenure-track professor in computational biology with generative AI focus — anshulkundaje · 2026-10-16