Conjecture on the size of the largest critical percolation cluster in a uniform triangulation
Statement
Let be a uniform triangulation with faces, and perform a critical site or bond percolation on . For random variables, write when, for every , the probability that tends to as tends to infinity. Largest-cluster conjecture. If denotes the largest black cluster in the percolated triangulation, then
The prediction follows the heuristic that a critical cluster of size is contained in a triangulation of size of order ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.