famous Mandelbrot’s conjecture.
Statement
famous Mandelbrot’s conjecture. Finally, it was proved by Kiefer \sqrt{ }and Mörters [8] that the dimension of double points on the Brownian frontier is ( 97 + 1)/24. The computation of the exact Hausdorff dimensions of the Brownian frontier and double points on the Brownian frontier relied on a so-called Brownian discon- nection exponent η(n). The value of η(n) was first conjectured by Duplantier and Kwon [4] to be 1 \sqrt{ } 2 (1) η(n) = 24n + 1 − 1 − 4 . 48 The rigorous proof of (1) was achieved by Lawler, Schramm and Werner [10, 11, 13, 12] using the Schramm-Loewner evolutions (SLE). 2. Brownian loop soup and generalized disconnection exponent The Brownian loop soup, introduced by Lawler and Werner [14], plays an im- portant role in random conformal geometry, due to its close connection to the conformal loop ensembles (CLE), the Gaussian free fields (GFF), etc. The Brown- ian loop soup is a Poisson point process which depends on an intensity parameter c > 0. It was proved in [20] that for c \in (0, 1], the Brownian loop soup in the unit disk a.s. exhibits infinitely many clusters, while for c > 1 it contains a single cluster. Moreover, for c \in (0, 1], the outer boundaries of the outermost clusters are distributed as a CLEκ , where (2) c(κ) = (6 − κ)(3κ − 8)/(2κ). For c \in (0, 1], since the outer boundary of a Brownian loop has dimension 4/3 and the CLEκ loop has dimension 1 + κ/8 > 4/3 [1], we can deduce that most points on the outer boundary of a cluster are not visited by any Brownian loop in the loop soup. On the other hand, [19, Lemma 4] implies that there do exist some Brownian loops that touch the outer boundary of a cluster. Whether there exist double points on the outer boundary of a cluster for c \in (0, 1] is far from obvious. We are particularly interested
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.