acceptodds
Preprint in the OpenAI Math release

Uniform marked-polygon estimates and sharp finite bridge moments

OpenAI

Abstract

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, first-length mass at most , and mass at least on bridges with length at least .

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.