2021
DOI: 10.48550/arxiv.2108.04421
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Uniform Spanning Tree in Topological Polygons, Partition Functions for SLE(8), and Correlations in $c=-2$ Logarithmic CFT

Mingchang Liu,
Eveliina Peltola,
Hao Wu

Abstract: We give a direct probabilistic construction for correlation functions in a logarithmic conformal field theory (log-CFT) of central charge −2. Specifically, we show that scaling limits of Peano curves in the uniform spanning tree in topological polygons with general boundary conditions are given by certain variants of the SLE κ with κ = 8. We also prove that the associated crossing probabilities have conformally invariant scaling limits, given by ratios of explicit SLE 8 partition functions. These partition fun… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…In the physics literature, percolation is usually investigated as a (non-unitary) conformal field theory (CFT) with central charge 𝑐 = 0. It is also a prototypical example of a logarithmic field theory [26,61], so that its study belongs to an area of research very active both in physics and mathematics (see, e.g., [26] and [47]). As such, percolation is often studied by analyzing connection probabilities (sometimes called connectivity functions).…”
Section: Background and Motivationmentioning
confidence: 99%
“…In the physics literature, percolation is usually investigated as a (non-unitary) conformal field theory (CFT) with central charge 𝑐 = 0. It is also a prototypical example of a logarithmic field theory [26,61], so that its study belongs to an area of research very active both in physics and mathematics (see, e.g., [26] and [47]). As such, percolation is often studied by analyzing connection probabilities (sometimes called connectivity functions).…”
Section: Background and Motivationmentioning
confidence: 99%
“…In general, for the range κ ∈ (0, 8], to our knowledge there are explicit formulas for Z α only when κ / ∈ Q (cf. [KP16]) and for a few special rational cases: κ = 2 [KKP20]; κ = 4 [PW19]; and κ = 8 [LPW21]. For κ ∈ (0, 6], an explicit probabilistic construction was given in [Wu20, Theorem 1.7], which immediately implies (1.15).…”
Section: Conjectures For Random-cluster Modelsmentioning
confidence: 99%
“…Its loop representation contains N interfaces η δ 2r−1 starting from y δ, 2r−1 , with 1 ≤ r ≤ N , terminating among the medial vertices {y δ, 2r : 1 ≤ r ≤ N }. Inspired by [LPW21] (see also [Izy15, Figure 2]), we define an exploration path ξ δ starting from the outer corner y δ, 1 and terminating at the outer corner y δ, 2 via the following procedure (see Figure 3.1).…”
Section: Exploration Process and Holomorphic Spinor Observablementioning
confidence: 99%
“…Our results show that such expressions may reduce to fewer terms, sometimes even a single term, for small N. Further, obtaining results for rational values of κ with quantum group methods is possible by taking the limit of the quantum group results but involves many cancelling terms, and thus appears complicated. See [52][53][54][55][56][57][58][59][60][61][62][63] for these and related results from quantum group and other methods.…”
Section: Introductionmentioning
confidence: 99%