Math-4269 · mathematics · Probability

Math-4269

Crossings in random square tilings

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

Let $\mathcal T$ be a finite or countable tiling of the closed unit square by squares of positive side length, with disjoint interiors and with at most three squares meeting at any corner. Color its squares black independently with probability $1/2$. A black left-to-right crossing is a connected black chain, or connected union of black tiles in the countable case, meeting both vertical sides. Write $q(\mathcal T)$ for its probability and $m(\mathcal T)=\sup_{Q\in\mathcal T}\operatorname{diam}(Q)$ for the mesh.

Statement recorded in the supplied source.
Prove that there is an absolute $c>0$ such that $q(\mathcal T)>c$ for every such tiling. Moreover, for every sequence of such tilings $\mathcal T_n$ with $m(\mathcal T_n)\to0$, prove $q(\mathcal T_n)\to1/2$. [S2]

Short English statement

Show that random square tilings always have a uniformly positive horizontal crossing probability and approach one half as the largest tile shrinks.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.