Preprint in the OpenAI Math release
Marked polygon correlations and one-arc bounds
OpenAI
Abstract
At the critical honeycomb vertex activity, the squared-length mass of simple polygons of diameter at most H, counted modulo translations, is at most . We also prove a quantitative two-mark cylinder estimate and a polynomial one-arc bound uniform even for arbitrarily unequal marked intervals.
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.