betaFeedback

WorksMathematics

On Romik's rationality conjectures for critical percolation

Abstract

The completely packed O(1)O(1) loop model can be viewed as an interface representation of critical bond percolation on the square lattice. We consider submatching events, which prescribe how these interfaces pair finitely many consecutive boundary points. Romik's rationality conjectures predict that the probabilities of these events on the semi-infinite cylinder are given by specific rational functions, which even become dyadic rationals in the half-plane limit. We derive explicit Pfaffian formulae for the probability of kk nested arches on the semi-infinite cylinder of circumference 2N2N, valid for k<Nk<N. We deduce that these probabilities are rational functions of NN and, by taking the limit N→∞N\to\infty, that the corresponding half-plane probabilities remain rational. This establishes key aspects of Romik's conjectures. Our proof uses identities of Fonseca and Zinn-Justin, derived through the qKZ formalism, which express these probabilities as ratios of enumeration numbers for totally symmetric self-complementary plane partitions (TSSCPPs). These plane partitions admit a dimer representation, allowing us to apply Kasteleyn theory. We evaluate the resulting hypergeometric sum using Zeilberger's and Gosper's algorithms and then take the half-plane limit N→∞N\to\infty. Along the way, we derive a somewhat simplified expression for the inverse Kasteleyn matrix entries (encoding correlations in TSSCPPs) of Ayyer and Chhita, which might be of independent interest.

Introduction

Background and motivation

A striking feature of many exactly solvable lattice models is that non-trivial finite-size observables can sometimes be described by explicit closed-form expressions. The completely packed O(1)O(1) loop model provides a particularly clear instance of this phenomenon. On the semi-infinite cylinder and in the half-plane, the interfaces induce random noncrossing matchings of boundary points. Of particular interest are submatching events, which prescribe the pairing of a fixed number of consecutive boundary points. Motivated by earlier numerical observations and conjectures, Romik conjectured a specific rational-function form for the probabilities of these events on the cylinder, as well as dyadic rationality of the corresponding half-plane probabilities; see [18] and references therein.

In this paper, we study submatching events consisting of nested arches. For each fixed k≥1k \ge1, we derive an explicit Pfaffian representation for the probability of kk nested arches on a semi-infinite cylinder of circumference 2N2N, for N>kN > k, and show that this probability is a rational function of NN. Taking the limit N→∞N \to\infty then establishes rationality of the corresponding half-plane probabilities. Our approach exploits a connection to totally symmetric self-complementary plane partitions (TSSCPPs) and their dimer representation.

The first step in this approach is provided by a result of Fonseca and Zinn-Justin [8]. Using integral formulae for a polynomial solution of the quantum Knizhnik–Zamolodchikov (qKZ) equation, they relate certain components and partial sums of the ground-state vector of the O(1)O(1) loop model to enumerations of families of non-intersecting lattice paths. These path ensembles admit a natural interpretation in terms of TSSCPPs. In particular, for the nested submatching events considered here, their results express the corresponding cylindrical probabilities as ratios of TSSCPP enumeration numbers, with the numerator counting configurations whose associated path ensemble has a prescribed number of initial horizontal paths.

A further advantage of this reformulation is that TSSCPPs admit a natural dimer representation. A plane partition in a 2N×2N×2N2N \times2N \times2N box can be represented as a lozenge tiling of a regular hexagon, and the symmetries of a TSSCPP allow one to restrict this description to a fundamental one-twelfth sector of the hexagon with a free boundary. Equivalently, the resulting tilings can be regarded as perfect matchings of an associated planar graph. Ayyer and Chhita [AC21] established the Pfaffian structure of this dimer model and derived explicit formulae for its inverse Kasteleyn matrix, with different expressions depending on the parities of the vertices. Building on these results, we derive explicit finite-sum expressions for the inverse Kasteleyn entries required to compute the cylindrical nested-arch probabilities through a Pfaffian.

The appearance of TSSCPPs in this problem is part of a broader context of connections between integrable lattice models and enumerative combinatorics. In particular, TSSCPPs have a long-standing relation to alternating sign matrices (ASMs). Mills, Robbins, and Rumsey [15] conjectured that TSSCPPs in a 2N×2N×2N2N \times2N \times2N box are counted by the same product formula as N×NN \times N ASMs. The TSSCPP enumeration was subsequently proved by Andrews [3], while the ASM enumeration was proved by Zeilberger [Zei96]; Kuperberg later gave an alternative proof of the latter using the six-vertex model [12].

By contrast, the connection between ASMs and the O(1)O(1) loop model is more direct. ASMs are in bijection with six-vertex configurations with domain-wall boundary conditions and, equivalently, with fully packed loop (FPL) configurations with alternating boundary conditions. The Razumov–Stroganov conjecture [RS04], proved by Cantini and Sportiello [6], identifies the appropriately normalised ground-state components of the periodic O(1) loop model with the numbers of FPL configurations having prescribed boundary link patterns. Together with the identities of Fonseca and Zinn-Justin, this theorem yields exact enumerative relations between constrained TSSCPP configurations and FPL configurations subject to prescribed boundary connectivities.

Beyond their combinatorial interest, these connectivity probabilities also raise the question of how exact lattice results relate to conformal structures in the continuum. The connectivity states of the completely packed O(1) loop model are naturally encoded by noncrossing link patterns, with the finite-size Hamiltonian acting on this space through Temperley–Lieb generators.

In the continuum, noncrossing link patterns also index the pure partition functions of multiple Schramm–Löwner evolutions (SLEs) [11]. It is therefore natural to ask whether the exact boundary connectivity probabilities studied here admit an interpretation within this continuum framework. Such an interpretation is not immediate: our infinite-circumference limit is taken at fixed lattice spacing, whereas a continuum scaling limit involves sending the lattice spacing to zero. In the latter limit, the neighbouring boundary points involved in a fixed submatching would coalesce, so any connection with multiple SLEs would have to account for this coalescence.

Further motivation for studying exact connectivity probabilities and their asymptotics comes from recent results on critical site percolation on the triangular lattice. Sun, Xu, and Zhuang [SXZ24] derived an exact formula for the probability of two disjoint open paths crossing an annulus in the continuum scaling limit. Nolin, Qian, Sun, and Zhuang [16] discuss the asymptotic expansion of this probability, whose leading behaviour is governed by the backbone exponent. The authors interpret the subleading terms as suggesting a connection with an underlying conformal field theory. Although these results concern a different observable, they illustrate how exact connectivity probabilities and their asymptotics may provide insight into continuum conformal structures.

Main results

We consider the completely packed O(1)O(1) loop model on the semi-infinite cylinder CNC_N of circumference 2N2N and on the upper half-plane H\mathbb{H}. In both geometries, the loop configuration consists almost surely of closed loops and paths connecting pairs of boundary points. These paths induce a random noncrossing matching of the boundary points; see § 4.

For k≥1k \ge1, let FkF_k denote the event that the 2k2k consecutive boundary points labelled 1,…,2k1,\ldots,2k are paired in a fully nested manner, with point ii connected to point 2k+1−i2k+1-i for i=1,…,ki=1,\ldots,k. We write PCN(Fk)\mathbb{P}_{C_N}(F_k) and PH(Fk)\mathbb{P}_{\mathbb{H}}(F_k) for the corresponding probabilities, with N≥kN \ge k in the cylindrical case.

Theorem 1.1. For every k≥1k \ge1, the probability PH(Fk)\mathbb{P}_{\mathbb{H}}(F_k) is rational.

The key step in proving Theorem 1.1 is the following stronger result for the cylindrical model.

Theorem 1.2. For every fixed k≥1k \ge1, there exists a rational function Rk∈Q(N)R_k \in\mathbb{Q}(N) such that

PCN(Fk)=Rk(N),N>k.(1)\mathbb{P}_{C_N}(F_k) = R_k(N), \qquad N > k. \tag*{(1)}

Our proof applies the inverse Kasteleyn formulae of Ayyer and Chhita [AC21] to the TSSCPP events arising from the Fonseca–Zinn-Justin correspondence [8]. This yields an explicit Pfaffian representation for the cylindrical probabilities, whose matrix size depends only on kk. We use Gosper’s and Zeilberger’s algorithms to obtain a closed-form evaluation of the hypergeometric term appearing in the matrix entries, thereby establishing that these entries are rational functions of NN. The restriction k<Nk < N reflects the range of the Fonseca–Zinn-Justin correspondence.

By the convergence of finite boundary connectivity probabilities as N→∞N \to\infty [18 Lemma 1.17], the half-plane probabilities are obtained as limits of the corresponding cylindrical probabilities. For fixed kk, each entry of the matrix in our Pfaffian representation converges to a rational number as N→∞N \to\infty. Since the Pfaffian is a polynomial in its matrix entries with integer coefficients, the half-plane probabilities are Pfaffians of matrices with rational entries. In particular, they are rational, proving Theorem 1.1.

Theorem 1.2 establishes rational-function dependence for the family of nested-arch events, as predicted by Romik’s conjecture [18 Conjecture 1.12]. However, the prescribed denominator and the additional properties of the numerator remain unproved. Likewise, our half-plane result establishes rationality of the corresponding probabilities, but not the dyadic rationality conjectured by Romik [18 Conjecture 1.3]. The precise statements of these conjectures are recalled in § 4.2.

The boundary case N=kN=k is not covered by Theorem 1.2. In this case, FkF_k specifies the fully nested matching, whose probability is 1/Ak1/A_k, where AkA_k denotes the number of alternating-sign matrices of order kk; see [7] and [18 Theorem 1.9]. For k≥2k \ge2, we have Rk−1(k)=1/AkR_{k-1}(k) = 1/A_k; see (11). Exact symbolic computations in Mathematica verify that Rk(k)=Rk−1(k)R_k(k) = R_{k-1}(k) for 2≤k≤82 \le k \le8, suggesting the following conjecture.

Conjecture 1.3. For every k≥2k \ge2, the rational function RkR_k from Theorem 1.2 satisfies

Rk(k)=Rk−1(k).(2)R_k(k) = R_{k-1}(k). \tag*{(2)}

This would extend the rational-function identity in Theorem 1.2 to N=kN = k for k≥2k \ge2, as predicted by Romik’s cylindrical rationality conjecture. The case k=1k = 1 follows from the explicit formula in [18 Eq. (7)].

The explicit Pfaffian representation also allows us to evaluate the half-plane probabilities for small values of kk. The first eight probabilities, obtained by exact symbolic computations in Mathematica, are listed in Table 1. The corresponding inverse Kasteleyn matrix entries are given in Section A.

kkPH(Fk)\mathbb{P}_{\mathbb{H}}(F_k)
1323\frac{3}{2^3}
259210\frac{59}{2^{10}}
37737221\frac{7737}{2^{21}}
46803145236\frac{6803145}{2^{36}}
540210542795255\frac{40210542795}{2^{55}}
61599678636998003278\frac{1599678636998003}{2^{78}}
74286724792457437361772105\frac{428672479245743736177}{2^{105}}
87741673306601864968429769132136\frac{774167330660186496842976913}{2^{136}}

Table 1. Probabilities of the nested-arch events in the half-plane.

The values for k=1,2,3k = 1, 2, 3 agree with the limits of the normalised enumeration formulae in [Zub04, Conjecture 8(ii)], where Zuber credits the cases k=1,2k = 1, 2 to Wilson. For k=1,2k = 1, 2, the same limiting values are predicted by the conjectured formulae of Mitra, Nienhuis, de Gier and Batchelor [14 Eqs. (30) and (34)]. All three values are listed in [18 Table 1]; the case k=1k = 1 was proved in [18 Theorem 1.4].

The denominators of these probabilities suggest additional structure beyond rationality, leading to the following conjecture.

Conjecture 1.4. For every k≥1k \ge1, there exists an odd integer aka_k such that

PH(Fk)=ak22k2+k.(3)\mathbb{P}_{\mathbb{H}}(F_k) = \frac{a_k}{2^{2k^2+k}}. \tag*{(3)}

The conjecture has also been verified by exact symbolic computation for k=17k = 17. The requirement that aka_k be odd implies that 22k2+k2^{2k^2+k} is the exact denominator of PH(Fk)\mathbb{P}_{\mathbb{H}}(F_k) in lowest terms. For nested-arch events, this conjecture therefore strengthens the dyadic-rationality assertion of Romik’s half-plane conjecture by prescribing the exact denominator.

The remainder of the paper is organised as follows. In § 4, we explain the connection between critical bond percolation and the completely packed O(1) loop model, introduce the relevant boundary connectivity events, and recall the two rationality conjectures of Romik relevant to our setting. We then introduce TSSCPPs and their representation as lozenge tilings and dimer configurations, before recalling the Fonseca–Zinn-Justin correspondence relating nested-arch probabilities to constrained TSSCPP enumerations.

In § 5, we simplify the inverse Kasteleyn matrix formulae of Ayyer and Chhita, obtaining results that may be of independent interest. In § 6, we translate the TSSCPP path constraints into prescribed-dimer events, express their probabilities in terms of Pfaffians, and identify the hypergeometric term requiring further analysis. In § 7, we rewrite this term in a suitable form, recall the necessary background on Gosper’s and Zeilberger’s algorithms, and use these algorithms to obtain a closed-form expression. This allows us to prove Theorem 1.2 and deduce Theorem 1.1. Finally, in § 8, we formulate a conjectured denominator bound that would imply dyadic rationality of the limiting inverse Kasteleyn entries and hence, via the Pfaffian representation, of the nested-arch probabilities. We verify this bound in special cases and discuss the difficulties in extending the argument to general parameters.

Remark 1.5. As we were finishing this draft we learnt from Dan Romik that he was able to obtain a full solution to the rationality conjectures with the help of AI. We will report on this progress and further results in forthcoming work [4].

Acknowledgements

This research was supported by the Austrian Science Fund (FWF), grant DOI 10.55776/F1002, within the Special Research Area “Discrete random structures: enumeration and scaling limits”. NB also acknowledges the support of grant 10.55776/PAT1878824 on “Random Conformal Fields” from the FWF. SC acknowledges the support of “Engineering and Physical Sciences Research Council” (EPSRC) EP/T004290/1.

For symbolic computations, the authors used the fastZeil package (version 3.61) from the RISCErgoSum collection, developed by Peter Paule, Markus Schorn, and Axel Riese.

Part of this paper was written while all three authors were visiting the Erwin Schrödinger Institute on the occasion of the programme “Discrete random structures” (BFT26). The authors gratefully acknowledge hospitality, and, in the case of SC, financial support from the institution. We are also grateful to Dan Romik for sharing with us at the end of this project his preliminary work solving his conjecture with the help of AI, see [4].

AI statement and methodology. The ideas for the results and the proofs themselves were entirely conceived without any use of AI tools. Different versions of ChatGPT (ranging from 5.2–6) were consulted after writing for assistance with language editing and improving the clarity and organisation of the exposition, as well as for occasional clarification of mathematical background and guidance on the use of Mathematica and the fastZeil package. The authors take full responsibility for the manuscript.

Notations and conventions

Throughout the paper, we write [j]2[j]_2 for jj mod 2 and denote the nn-th Catalan number by Cn=1n+1(2nn)C_n = \frac{1}{n+1}\binom{2n}{n}. Since conventions for binomial coefficients vary across the literature, we state ours explicitly to avoid ambiguity. For integers a,ba,b, the binomial coefficient (ab)\binom{a}{b} is nonzero if and only if a≥b>0a \ge b > 0 or b=0b = 0. In the latter case, we define (a0)=1\binom{a}{0} = 1 for every a∈Za \in\mathbb{Z}, including negative aa. Furthermore, we adopt the convention sgn⁡(0)=0\operatorname{sgn}(0) = 0 and take empty sums and products to be 0 and 1, respectively.

Preliminaries

Critical bond percolation and the O(1)O(1) loop model

The main object of study is the completely packed O(1)O(1) loop model. It can be constructed from critical bond percolation on the square lattice Z2\mathbb{Z}^2 by drawing the interfaces between open clusters and dual open clusters. We first recall bond percolation and then describe this construction.

In Bernoulli bond percolation with parameter pp, each edge of Z2\mathbb{Z}^2 is independently declared open with probability pp and closed with probability 1−p1-p. The connected components of the subgraph formed by the open edges are called open clusters. Critical bond percolation corresponds to p=pc=12p=p_c=\frac{1}{2} [9, 10]. This critical value separates the regime p≤pcp\leq p_c, in which almost surely no infinite open cluster exists, from the regime p>pcp>p_c, in which an infinite open cluster exists almost surely.

To describe the corresponding loop representation, we introduce the primal and dual lattices, together with the medial lattice and its dual. We refer to the original square lattice as the primal lattice; in Figure 1a, it is drawn in black. The open edges in the bond-percolation configuration are shown in blue. The dual lattice is obtained by placing one vertex in each face of the primal lattice and joining vertices in adjacent faces, so that each dual edge crosses exactly one primal edge; in Figure 1a, it is drawn in grey. The corresponding dual configuration is obtained by declaring a dual edge open precisely when the primal edge it crosses is closed; we draw these open dual edges in red. Consequently, no open primal edge crosses an open dual edge, and the primal and dual configurations determine each other uniquely. Throughout, we use the rotated representation of the primal and dual lattices shown in Figure 1a.

Figure 1. (a) Open primal (blue) and dual (red) bonds. (b) Interfaces (yellow) separating primal and dual open clusters. (c) The same interfaces on the plaquette lattice M∗M^* (black). Correspondence between bond percolation and the loop representation.

To construct the plaquette representation of the loop model, let MM denote the medial lattice of the primal lattice. Its vertices are the midpoints of the primal edges, with two vertices joined by an edge whenever the corresponding primal edges are adjacent sides of a common face of the primal lattice. We call the dual lattice M∗M^* of MM the plaquette lattice, and call its faces plaquettes. Both MM and M∗M^* are square lattices rotated by 45∘45^\circ relative to the primal and dual lattices. The lattice M∗M^* is shown in black in Figure 1c. Each medial vertex lies at the intersection of a primal edge and its dual edge, exactly one of which is open. We pair the four incident medial half-edges by joining the two lying on each side of the open edge. These pairings partition the edges of MM into edge-disjoint trails whose consecutive edges meet at right angles. Smoothing the pairings at the medial vertices yields noncrossing interfaces separating primal open clusters from dual open clusters, which are drawn in yellow in Figure 1b and Figure 1c. Figure 1b shows the interfaces together with the open primal and dual edges, while Figure 1c shows the same interfaces in the plaquette representation on M∗M^*.

Each face of M∗M^* contains exactly one medial vertex, so the two possible pairings at that vertex can be represented by the two plaquette types shown in Figure 2. From now on, we use this plaquette representation on M∗M^*. The two plaquette types correspond to the standard local connectivities of the planar Temperley–Lieb algebra; see, for example, [13]. Under periodic boundary conditions, as in the cylindrical geometry considered below, they are naturally described within the affine Temperley–Lieb algebra.

The two plaquette types of the completely packed $O(1)$ loop model

Figure 2. The two plaquette types of the completely packed O(1)O(1) loop model.

At criticality, p=12p=\frac{1}{2}, and each face of M∗M^* independently receives either of the two plaquette types with equal probability. In the general O(τ)O(\tau) loop model, each closed loop carries an additional weight τ\tau. In our case, τ=1\tau=1, so no additional weighting of loops occurs. Since every face of M∗M^* is occupied by one of the two plaquette types, the resulting loop configuration is completely packed. Following [ZJ09], we refer to this model as the completely packed O(1)O(1) loop model.

We denote the loop configuration by ω\omega.

Connectivity events and Romik’s rationality conjectures

To formulate Romik’s rationality conjectures, we consider the loop model on the semi-infinite cylinder CNC_N or the upper half-plane H\mathbb{H}. In the plaquette representation, we identify the underlying lattices with the graphs having vertex sets

V(CN)=(Z/(2NZ))×Z≥0,V(H)=Z×Z≥0,V(C_N) = (\mathbb{Z}/(2N\mathbb{Z})) \times\mathbb{Z}_{\ge0}, \qquad V(\mathbb{H}) = \mathbb{Z} \times\mathbb{Z}_{\ge0},

respectively. Both lattices have nearest-neighbour edges, with horizontal coordinates understood modulo 2N2N on CNC_N. For N=1N=1, the periodic construction retains the two distinct horizontal edges joining the same pair of vertices.

In both geometries, the interfaces may form closed loops, paths connecting two boundary points, or infinite paths. However, infinite paths occur with probability zero in either geometry. In the half-plane, this follows by restricting the full-plane configuration to the half-plane. Indeed, at criticality, the full-plane interfaces are almost surely finite, since neither the primal nor the dual percolation configuration contains an infinite open cluster. On CNC_N, an alternating row of plaquettes prevents interfaces from crossing the row. Such rows occur independently with probability 21−2N>02^{1-2N}>0, and hence infinitely often almost surely by the second Borel–Cantelli lemma; see [18 Lemma 1.6] for details. Consequently, almost surely every interface is either a closed loop or a finite path connecting two boundary points.

We regard the half-plane model as the infinite-circumference limit of the cylindrical model. This convergence relies on the almost sure finiteness of the half-plane interface paths established above. More precisely, for any fixed finite collection of prescribed connections between boundary points, the corresponding probabilities on CNC_N converge to those on H\mathbb{H} as N→∞N\to\infty; see [18 Lemma 1.17] for a detailed argument.

We now focus on the connectivity of interface paths with endpoints on the boundary. In both geometries, the boundary vertices are precisely those with second coordinate zero. In the plaquette representation, the interface endpoints lie at the midpoints of the horizontal edges along this boundary; see Figure 3a for an example.

Portion of a loop configuration and corresponding boundary connectivities

Figure 3. (a) Portion of a loop configuration. (b) Corresponding boundary connectivities. Figure 3: Example of a loop configuration in the half-plane and its corresponding link pattern.

Fix x∈Zx\in\mathbb{Z} and set

bj=(x+j−12,0).b_j=\left(x+j-\frac{1}{2},0\right).

On CNC_N, we take j=1,…,2Nj=1,\ldots,2N, with horizontal coordinates understood modulo 2N2N; on H\mathbb{H}, we take j∈Zj\in\mathbb{Z}. In either case, we label the boundary point bjb_j by jj.

Definition 2.1. A noncrossing matching, or link pattern, of order kk is a perfect matching Π\Pi of {1,…,2k}\{1,\ldots,2k\}, which we represent by a fixed-point-free involution

πΠ:{1,…,2k}→{1,…,2k},\pi_{\Pi}:\{1,\ldots,2k\}\to\{1,\ldots,2k\},

such that there do not exist a<b<c<da < b < c < d with

πΠ(a)=candπΠ(b)=d.\pi_{\Pi}(a)=c \qquad\text{and} \qquad\pi_{\Pi}(b)=d.

References

  1. [2]Arvind Ayyer, Sunil Chhita, and Kurt Johansson. GOE fluctuations for the maximum of the top path in alternating sign matrices. Duke Mathematical Journal, 172(10):1961–2014, July 2023.arxiv.org/abs/2109.02422
  2. [3]George E Andrews. Plane partitions V: The TSSCPP conjecture. Journal of Combinatorial Theory, Series A, 66(1):28–39, 1994.DOI
  3. [4]Melda Akyazi-Zavdaski, Nathanaël Berestycki, Sunil Chhita, and Dan Romik. A proof of Romik’s algebraicity conjecture for loop percolation (in preparation).
  4. [5]Nathanaël Berestycki, Marcin Lis, and Wei Qian. Free boundary dimers: random walk representation and scaling limit. Probability Theory and Related Fields, 186(3):735–812, 2023.DOI
  5. [6]Luigi Cantini and Andrea Sportiello. Proof of the Razumov–Stroganov conjecture. Journal of Combinatorial Theory, Series A, 118(5):1549–1574, July 2011.arxiv.org/abs/1003.3376
  6. [7]P. Di Francesco and P. Zinn-Justin. Around the Razumov–Stroganov conjecture: proof of a multi-parameter sum rule. The Electronic Journal of Combinatorics, 12(1):R6, January 2005.
  7. [8]Tiago Fonseca and Paul Zinn-Justin. On some ground state components of the O(1) loop model. Journal of Statistical Mechanics: Theory and Experiment, 2009(03):P03025, March 2009.
  8. [9]T. E. Harris. A lower bound for the critical probability in a certain percolation process. Proceedings of the Cambridge Philosophical Society, 56(1):13–20, January 1960.DOI
  9. [10]Harry Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communications in Mathematical Physics, 74(1):41–59, February 1980.DOI
  10. [11]Kalle Kytölä and Eveliina Peltola. Pure partition functions of multiple SLEs. Communications in Mathematical Physics, 346(1):237–292, August 2016.DOI
  11. [12]Greg Kuperberg. Another proof of the alternating-sign matrix conjecture. International Mathematics Research Notices, 1996(3):139–150, January 1996.DOI
  12. [13]Alexi Morin-Duchesne, Andreas Klümper, and Paul A. Pearce. Conformal partition functions of critical percolation from D₃ thermodynamic Bethe Ansatz equations. Journal of Statistical Mechanics: Theory and Experiment, 2017(8):083101, August 2017.
  13. [14]S. Mitra, B. Nienhuis, J. de Gier, and M. T. Batchelor. Exact expressions for correlations in the ground state of the dense O(1) loop model. Journal of Statistical Mechanics: Theory and Experiment, 2004(09):P09010, 2004.DOI
  14. [15]W. H. Mills, David P. Robbins, and Howard Rumsey, Jr. Self-complementary totally symmetric plane partitions. Journal of Combinatorial Theory, Series A, 42(2):277–292, July 1986.DOI
  15. [16]Pierre Nolin, Wei Qian, Xin Sun, and Zijie Zhuang. Backbone exponent and annulus crossing probability for planar percolation. Physical Review Letters, 134(11):117101, March 2025.arxiv.org/abs/2410.06419
  16. [17]M. Petkovšek, H. S. Wilf, and D. Zeilberger. A = B. A K Peters, 1996.
  17. [18]Dan Romik. Connectivity patterns in loop percolation I: the rationality phenomenon and constant term identities. Communications in Mathematical Physics, 330(2):499–538, September 2014.

Paper details

vlnc:W_jnba87dz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT (multiple versions)

View statement
Looking for related papers…
Contents