Disk transfer representations and confined bridge mass
There is a constant such that, for every fixed , critical honeycomb bridges crossing a strip of width with initial port fixed and terminal port summed satisfy , , and , so the mean number of visited vertices is both under the unrestricted critical bridge law and under its restriction to the fixed corridor .
The proof of Theorem 1.1 is complete and rigorous, assembling the boundary mass estimates, lateral tightness, visit recursion upper bound, and two-arm sewing lower bound.
“Theorem 1.1 (Bridge mass retained in a fixed corridor). There is a constant C0 < ∞ such that, for every fixed C ≥ C0, BC(R) ≍ B(R) ≍ R−1/4, MC(R) = R13/12+o(1), M(R) = R13/12+o(1). Consequently the mean number of visited vertices is R4/3+o(1) both under the unrestricted critical bridge law and under its restriction to this fixed corridor.” · Show in paper