A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The three-quarter diameter exponent for honeycomb walks
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Snaky <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:luck, magnets Levels:13
Category:Probability and statistical mechanics Lean version:YES! ✔
Rate this game! 4.5 out of 5 (4,548 votes)

>>> How to Play <<<
The three-quarter exponent for honeycomb self-avoiding walk. Proves the diameter form of Nienhuis's predicted three-quarter exponent: a uniformly chosen n-step self-avoiding walk on the honeycomb lattice has diameter $n^{3/4+o(1)}$. Its local mass and covering numbers have exponent 4/3. These estimates hold at every sufficiently large fixed length, simultaneously across scales, with arbitrarily high polynomial probability.

>>> Level Select <<<
released 2026-09-26  |  4 theorems · 2 lemmas · 11 proofs · 48,544 words  |  PLAY LEVEL 1 »  (pdf)
We prove critical diameter-tail exponents −2 for unrooted honeycomb polygons and −2/3 for length-weighted polygons, together with a truncated second-length-moment bound of exponent 2/3. Consequently, polygons conditioned to have length at least n have diameter $n^{3/4+o(1)}$ in probability under either weight.
released 2026-09-26  |  8 theorems · 8 lemmas · 17 proofs · 20,928 words  |  PLAY LEVEL 2 »  (pdf)
Critical self-avoiding walks between prescribed, macroscopically separated boundary ports of a regular honeycomb hexagon have length $R^{4/3+o(1)}$ in probability, where R is the scale of the hexagon. We prove the corresponding statements for half-plane arches, parallel cuts and nonparallel pure cuts. The half-plane law also has mean length $R^{4/3+o(1)}$. A separate strip argument gives endpoint mean laws on one density-one set of heights and in an aligned, critically weighted mixture of all even heights in a macroscopic interval.
released 2026-09-26  |  10 theorems · 27 lemmas · 50 proofs · 41,782 words  |  PLAY LEVEL 3 »  (pdf)
We determine the growth exponent, at every fixed positive loop fugacity, of the critical honeycomb partition function for disjoint polygons separating two prescribed markers on a balanced cylinder. At fugacity two the cylinder exponent is 1/6; the corresponding planar nesting exponent and middle-strip nesting exponent are 1/12.
released 2026-09-26  |  11 theorems · 24 lemmas · 41 proofs · 34,842 words  |  PLAY LEVEL 4 »  (pdf)
For uniform self-avoiding walks of every sufficiently large integer length on the honeycomb lattice, we prove diameter exponent 3/4 and simultaneous local-mass and covering exponent 4/3, with arbitrary positive exponent slack and arbitrary polynomial failure probability.
released 2026-09-26  |  5 theorems · 24 lemmas · 38 proofs · 54,273 words  |  PLAY LEVEL 5 »  (pdf)
At the critical activity and loop fugacity two, we prove a 1/6 partition exponent for disjoint honeycomb polygons separating opposite marks on a balanced infinite cylinder, and a 1/12 planar nesting exponent. For ordered first-exit chords in a regular hexagon of side R, with both boundary ports summed and diameter at least $R/10$, the finite critical partition is $R^{3/4+o(1)}$ and the normalized mean length is $R^{4/3+o(1)}$. A separate two-bond estimate on tilted cylinders with controlled site proportions bounds the length-square mass of planar polygons of diameter at most H, modulo translations, by $H^{2/3+o(1)}$.
released 2026-09-26  |  2 theorems · 4 lemmas · 17 proofs · 50,109 words  |  PLAY LEVEL 6 »  (pdf)
We prove a logarithmic window of critical honeycomb bridge lengths: summed through height $2h(\log h)^{1/64}$, bridges of lengths between $h^{4/3}(\log h)^{-1/8}$ and $2h^{4/3}(\log h)^{1/2}$ have mass at least $h^{3/4}(\log h)^{-C}$.
released 2026-09-26  |  6 theorems · 17 lemmas · 27 proofs · 28,467 words  |  PLAY LEVEL 7 »  (pdf)
At the critical honeycomb vertex activity, the squared-length mass of simple polygons of diameter at most H, counted modulo translations, is at most $H^{2/3+o(1)}$. We also prove a quantitative two-mark cylinder estimate and a polynomial one-arc bound uniform even for arbitrarily unequal marked intervals.
released 2026-09-26  |  3 theorems · 4 lemmas · 10 proofs · 39,944 words  |  PLAY LEVEL 8 »  (pdf)
We prove that critical honeycomb bridges crossing a strip of width R have mean length $R^{4/3+o(1)}$, with the same exponent after confinement to a fixed multiple of the strip width. The initial boundary port is fixed, the terminal port is summed, and all finite lengths receive their critical weights. The bridge mass is comparable to R−1/4; the half-plane arch kernel at endpoint separation m is comparable to m−5/4.
released 2026-09-26  |  3 theorems · 12 lemmas · 23 proofs · 32,875 words  |  PLAY LEVEL 9 »  (pdf)
We prove that, under the all-length critical measure, a honeycomb bridge crossing a strip of h layers, with its initial port fixed and its terminal port free, has mean length $h^{4/3+o(1)}$. We also obtain central visit probability $R^{-2/3+o(1)}$ and mean length $R^{4/3+o(1)}$ for macroscopic free-boundary chords in a regular hexagon.
released 2026-09-26  |  14 theorems · 28 lemmas · 62 proofs · 47,698 words  |  PLAY LEVEL 10 »  (pdf)
For critical honeycomb self-avoiding walk, we prove spatial exponent 3/4 for the infinite irreducible-bridge law and for bridges of every sufficiently large compatible even length. We establish the corresponding thermal laws at every large discount scale, including all positive length and spatial moments. For unrestricted uniform walks, the endpoint lower law holds on a common set of lengths of natural density one. We also determine the near-critical exponential correlation scale and small-force free-energy exponent, and prove spatial local lower bounds that permit conditioning on a prescribed terminal vertex.
released 2026-09-26  |  1 theorem · 10 lemmas · 12 proofs · 11,999 words  |  PLAY LEVEL 11 »  (pdf)
At the critical weight of the regular honeycomb lattice, the total weight of self-avoiding paths crossing a strip of height N is comparable to N−1/4. The first horizontal-displacement moment of return paths is comparable to N3/4.
released 2026-09-26  |  4 theorems · 6 lemmas · 28 proofs · 55,488 words  |  PLAY LEVEL 12 »  (pdf)
We prove a uniform bound for critical honeycomb polygons through two axial marks on a periodic staircase. The bound retains an explicit power of the ratio between the period and the marked separation. We also prove sharp finite strip estimates: bridge mass of order h−1/4, first-length mass at most $Ch^{13/12}$, and mass at least $ch^{-1/4}$ on bridges with length at least $ch^{4/3}$.
released 2026-09-26  |  3 theorems · 5 lemmas · 13 proofs · 40,377 words  |  PLAY LEVEL 13 »  (pdf)
At the critical honeycomb fugacity, self-avoiding port-to-port chords in an equilateral lattice triangle of side R, summed over both boundary endpoints and restricted to diameter at least $R/100$, have partition sum comparable to R3/4 and mean length $R^{4/3+o(1)}$. We also determine the amplitude selected by two vacuum caps on a cylinder of circumference N and prove that it grows as $N^{1/6+o(1)}$.

More Probability and statistical mechanics Games!
Random-SAT thresholds, sharp variance and computabilityThe factor-of-IID threshold for free Ising states on treesOptimal logarithmic mixing of the Thorp shuffleSharp singularity rates for symmetric sign matrices
Geometry, diffusion, and spectra of random planar mapsNo bigeodesics and smooth limit shapes in planar first-passage percolationNo infinite critical clusters on quasi-transitive graphsThe Benjamini–Schramm nonuniqueness conjecture

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games