ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TnT_n be a uniform triangulation with nn faces, and perform a critical site or bond percolation on TnT_n. For random variables, write Xn≈nαX_n\approx n^{\alpha} when, for every ϵ>0\epsilon>0, the probability that nα−ϵ<Xn<nα+ϵn^{\alpha-\epsilon}<X_n<n^{\alpha+\epsilon} tends to 11 as nn tends to infinity. Largest-cluster conjecture. If Cmax\mathfrak{C}_{\mathrm{max}} denotes the largest black cluster in the percolated triangulation, then

v(Cmax)≈n7/8.\mathrm{v}(\mathfrak{C}_{\mathrm{max}})\approx n^{7/8}.

The prediction follows the heuristic that a critical cluster of size nn is contained in a triangulation of size of order n8/7n^{8/7}; it further asserts that the initial cluster has a positive chance of being the largest cluster after the filling operation. The claim remains conjectural.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.