Steinitz walk — short partial sums at any length (3D)

About this app

Many short arrows, each may be flipped: does the walk of partial sums stay in a ball of radius √d, however long it is? Random signs run off like √n, the greedy choice fails against an adversarial sequence, a search over the whole sequence stays inside. Sliders for steps (up to 2000) and dimension (2–12), charts over n and over d. Euclidean Steinitz–Bergström theorem, openai/math family 097 (formalised in Lean). Exhibit-ready.

Subject: Open problems, solved by AI

More from Open problems, solved by AI

• Anderson localisation: 2D vs. 3D (3D)
• Barnette's conjecture: a round trip over every polyhedron (3D)
• Cardy's formula — percolation in a random tiling
• The plane is not five-colourable (Hadwiger–Nelson)
• Triangular billiards — irrational angles mix (3D)
• Triangular lattice — universal optimality
• First-passage percolation
• Gaussian moat — no path to infinity

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps