Preprint in the OpenAI Math release
Critical honeycomb chords with prescribed boundary endpoints
OpenAI
Abstract
Critical self-avoiding walks between prescribed, macroscopically separated boundary ports of a regular honeycomb hexagon have length 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 . 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.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.