Pith. sign in

REVIEW 3 major objections 4 minor 47 references

New scaling laws for self-avoiding walks: bridges and worms

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Pith's one-line read The paper derives scaling laws that make the critical exponents of self-avoiding bridges and worms functions of known walk, arch, and length exponents.

desk verdict Two likely-correct scaling laws for SAW subsets, with a clean worm argument and a bridge derivation that has an internal bookkeeping gap but is backed by strong numerics. read the letter →

arxiv 1908.03872 v2 pith:F6VE62GP submitted 2019-08-11 cond-mat.stat-mech math-phmath.COmath.MP

classification cond-mat.stat-mechmath-phmath.COmath.MP MSC 82B4182B2782D60 PACS 64.60.Fr05.70.Jk
keywords self-avoidingwalksbridgeswormsarchescriticalexponentspolymernetworksscalingrelationssurfacetransitions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Self-avoiding walks come in constrained families: bridges stay above a surface and end at their unique highest point, while worms are walks whose two endpoints share the same horizontal coordinate. This paper derives scaling laws saying neither family has an independent critical exponent. The bridge exponent equals the arch exponent plus the length exponent, $\gamma_b=\gamma_{1,1}+\nu$, and the worm exponent equals the walk exponent minus the length exponent, $\gamma_w=\gamma-\nu$. The derivation applies the polymer-network exponent formula, modelling the bridge endpoint as a vertex on a virtual surface plane, and is supported by series and Monte Carlo data in two and three dimensions. If the paper is right, counting bridges and worms adds no new universality classes.

What carries the argument

The load-bearing object is the configurational exponent formula for polymer networks, $\gamma_G=\nu[dV+(d-1)(V_S-1)-\sum_L n_L x_L-\sum_L n^S_L x^S_L]-(N-1)$, which expresses a network's critical exponent in terms of counts of bulk and surface vertices of each leg number. The paper's new move is to put the bridge's unique highest endpoint on a virtual plane parallel to the anchoring surface, so the bridge becomes a network with two surface 1-leg vertices; the formula then reads off $\gamma_b=\gamma_{1,1}+\nu$. A companion graphical 'vertex algebra' cancels common vertices on both sides of identities, turning exponent equalities into statements about the remaining vertices, and the same machinery produces the worm relation and the special-transition bridge relation.

What would settle it

Enumerate bridges, arches, and worms on the simple cubic lattice to length $n\approx 60$ with exact counting or a Monte Carlo method, estimate $\gamma_b$, $\gamma_{1,1}$, and $\gamma_w$ independently from the coefficient sequences, and check whether $\gamma_b-\gamma_{1,1}=\nu$ and $\gamma_w=\gamma-\nu$ hold within the combined error bars; a deviation of more than a few times $10^{-4}$ would refute the scaling laws.

Watch

Extended reading notes

Core claim

The paper's central claim is that the critical exponent for self-avoiding bridges, $\gamma_b$, satisfies $\gamma_b=\gamma_{1,1}+\nu$, where $\gamma_{1,1}$ is the exponent for arches and $\nu$ is the correlation-length exponent. The argument represents a bridge as a polymer network with one fixed surface vertex at its start and a movable surface vertex at its unique highest endpoint, the latter lying on a virtual plane parallel to the anchoring surface; applying the network exponent formula then yields the identity. For worms, the same formula with the two endpoints treated as free 1-leg vertices gives $\gamma_w=\gamma-\nu$. At the special surface transition the bridge relation becomes $\gamma_b^{(\mathrm{sp})}=\frac12[\gamma_{11}^{(\mathrm{sp})}+\gamma_{11}]+\nu$. The paper supports these identities with two- and three-dimensional series and Monte Carlo data.

Load-bearing premise

The derivation assumes that a bridge's unique highest endpoint behaves exactly like a vertex attached to a flat surface, so the standard surface-vertex exponent applies to it; if that equivalence fails, the bridge relation has no derivation.

Editorial extensions

If this is right

  • In two dimensions the relations fix $\gamma_b=9/16$ and $\gamma_w=19/32$, matching the established numerical value for bridges and series estimates for worms.
  • In three dimensions the worm relation predicts $\gamma_w=0.56936\pm0.000016$, a value that future enumeration or Monte Carlo work can check.
  • The bridge identity can be rewritten as $\gamma_1=(\gamma+\gamma_b)/2$, so the terminally-attached walk exponent is exactly the midpoint of the bulk and bridge exponents.
  • Bridges and worms do not define new universality classes: their critical exponents are combinations of $\gamma$, $\gamma_{1,1}$, and $\nu$, leaving only their amplitude factors as new information.
  • At the special surface transition the bridge exponent is $\gamma_b^{(\mathrm{sp})}=\frac12[\gamma_{11}^{(\mathrm{sp})}+\gamma_{11}]+\nu$, which evaluates to $17/16$ in two dimensions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • This suggests the same virtual-plane construction can be applied to other geometrically constrained walk subsets, such as walks whose endpoint is constrained to any fixed hyperplane, producing a family of exponent identities beyond bridges and worms.
  • The graphical cancellations in the paper look as though they could be promoted from exponent identities to exact generating-function identities, which would yield a combinatorial proof of $\gamma_b=\gamma_{1,1}+\nu$ independent of renormalization theory.
  • The worm argument implies a concrete distributional prediction: among $n$-step self-avoiding walks, the fraction ending on any fixed ray should decay as $n^{-\nu}$, a property testable on any lattice and not limited to the square lattice.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes new scaling relations for two subsets of self-avoiding walks: bridges, whose endpoint is the unique maximum height, and worms, whose endpoints share the same x-coordinate. Using the polymer-network exponent formula, Eq. (1), the authors derive γ_b = γ_{1,1} + ν for bridges and γ_w = γ − ν for worms, along with a special-transition analogue γ_b(sp) = (γ_{1,1}(sp)+γ_{1,1})/2 + ν. The relations are supported by exact two-dimensional exponent values, by high-precision three-dimensional Monte Carlo estimates of γ_b from earlier work, and by series analysis of two-dimensional worm data. The paper does not present new enumerations or rigorous proofs, but rather a scaling framework and numerical consistency checks.

Significance. If correct, the relations are significant because they connect bridge and worm exponents to the better-known bulk, surface, and correlation-length exponents, thereby reducing the number of independent exponents in the self-avoiding walk universality class. The three-dimensional numerical check is genuinely striking: 2γ_1 − γ = 0.198377 agrees with the direct Monte Carlo value γ_b = 0.198352 ± 0.000027, and the two-dimensional exact values reproduce γ_b = 9/16. The worm relation is simple and is confirmed in two dimensions to five digits. The paper benefits from the authors' authority and from the use of precise existing data, even though no new data or reproducible code are supplied. The main weakness is that the bridge derivation rests on an unproved 'virtual surface' modeling assumption, and the special-transition test is partly circular.

major comments (3)
  1. [Section 2, Eq. (7), Fig. 3] The derivation of γ_b = γ_{1,1} + ν rests on the assumption that a bridge endpoint, the unique maximum height of the walk, can be modelled as a surface 1-leg vertex on a virtual parallel surface at maximal displacement. This is not a direct application of Eq. (1), which was derived for networks interacting with a single physical surface. With the bridge origin fixed on the real surface and the endpoint on the virtual surface, the graph has two surface vertices and no bulk vertices, so Eq. (1) would appear to give γ_{1,1} rather than γ_b. To obtain the extra +ν, you set V = 1, VS = 1, effectively inserting a bulk vertex that encodes vertical mobility of the endpoint; this step and the treatment of the single-touch constraint (the top level is visited exactly once) are not justified. The polygon analogy in Fig. 2 is not transferable: polygons have no distinguished endpoint, and the top vertex is an interior point whose position contributes a factor n, whereas a bridge endpoint is a 1-leg vertex with a uniqueness constraint. Please either prove, or cite a proof, that the bridge endpoint has the surface scaling dimension x_1^S and that no extra power of n arises from the single-touch constraint, or explicitly present Eq. (7) as a conjecture supported by the numerical evidence.
  2. [Section 2.1 and 2.3, Eq. (9)] The special-transition relation γ_b(sp) = (γ_{1,1}(sp)+γ_{1,1})/2 + ν is obtained by replacing one of the two x_1^S in Eq. (7) by x_1^S(sp). This assumes that the virtual-surface endpoint at the bridge maximum can also be assigned a special-transition surface exponent, even though that point is not in contact with an adsorbing surface. Moreover, the numerical support in §2.3 is not an independent test: γ_{1,1}(sp) is inferred from γ_1(sp) via Eq. (4), then Eq. (9) is used to convert it to γ_b(sp), and the epsilon expansion for γ_b(sp) is derived from the same Eq. (9). No direct Monte Carlo or exact measurement of γ_b(sp) is provided. The agreement with the epsilon expansion value 0.760 at ε = 1 is therefore a consistency check, not a confirmation of Eq. (9).
  3. [Section 3] The derivation of γ_w = γ − ν from Eq. (1) uses the inconsistent assignment VS = 2, V = 0, n1 = 2, nS_1 = 0. If the two endpoints are surface vertices, they should be counted as nS_1 = 2 and n1 = 0; that assignment would give γ_{1,1} at d = 2, not γ − ν. The result γ − ν follows only if the (d−1)(VS−1) phase-space factor is retained while the legs are treated as bulk vertices, which is not a permitted reading of Eq. (1). The geometric argument in the same section, based on the n^{−ν} probability that a SAW endpoint lies on a given radial line, is much clearer and sufficient. I recommend making that the primary derivation and clarifying why the network formula is being applied in a non-standard way.
minor comments (4)
  1. [Eq. (7)] The displayed formula γ_b = ν[2 − 2x_1^S] appears to be dimension-specific. With V = 1 and VS = 1, Eq. (1) gives ν[d − 2x_1^S] = γ_{1,1} + ν for general d. Please correct the displayed equation to read ν[d − 2x_1^S].
  2. [Section 3] The two-dimensional worm verification 'to five-digit precision' is not reproducible from the manuscript: the data are from a private communication by Iwan Jensen, and the series-analysis method and error estimate are not described. Please include the method or a reference to a published source.
  3. [Section 2.2] The epsilon expansion for γ_b is presented without derivation. Please state explicitly that it is obtained by substituting Eq. (7) into the known epsilon expansions for γ_{1,1} and ν (or for γ_1 and γ), so that the reader sees the logical chain.
  4. [Throughout] The notation γ11 versus γ_{1,1} is used inconsistently; please standardize. There are also minor typographical errors such as 'proportinal' in Section 3 and 'configurational' in the text.

Circularity Check

1 steps flagged · score 2.0 of 10

Main bridge and worm derivations are self-contained; only the special-transition numerical agreement is circular because both arms pass through the paper's Eq. (9).

  1. other [Section 2.3, Eq. (9) and the paragraph beginning 'Monte Carlo calculations of γ1(sp)...']
    "Monte Carlo calculations of γ1(sp) combined with the scaling relation (4), also valid at the special transition point, allows us to estimate γ11(sp). ... and so γb(sp)≈ 0.746. This is in surprisingly good agreement with the epsilon expansion result given in the previous paragraph."

    The 'epsilon expansion result' for γ_b(sp) was obtained one paragraph earlier by inserting the Reeve/Diehl-Dietrich ε-expansion for γ_11(sp) into the paper's new relation (9). The 'Monte Carlo' value is not a measurement of γ_b(sp): it is obtained from Monte Carlo γ_1(sp) via Barber's relation (4) to get γ_11(sp), and then through the same new relation (9). Both compared numbers are therefore images of γ_11(sp) under Eq. (9); they would agree if the two literature values of γ_11(sp) agree, regardless of whether Eq. (9) is true. The comparison cannot provide independent confirmation of the bridge special-transition scaling law.

full rationale

The primary results are not circular. Eq. (7), γ_b = γ_11 + ν, is obtained by applying the pre-existing network formula (1), which is not fitted here, to a bridge represented with two surface one-leg vertices and one vertical degree of freedom; the resulting numerical value is checked against direct bridge enumerations and Monte Carlo results from Ref. [11] in d=2 and d=3. The worm relation γ_w = γ − ν is derived from the same formula, or equivalently from the independent radial-line scaling argument, and is confirmed against two-dimensional series data. The only load-bearing step that is circular is the special-transition comparison in Section 2.3, where both the predicted and the 'measured' γ_b(sp) are computed using the paper's own Eq. (9), so the agreement is forced by construction rather than being an independent test. Since this circularity is confined to a secondary numerical consistency check and does not affect the ordinary-transition bridge or worm claims, the overall circularity score is low.

Assumptions & free parameters 0 free parameters · 4 assumptions · 1 invented entities

The derivation borrows the full polymer network exponent formula from prior work and imports known exponents. The only new structural input is the virtual-surface representation for bridges and an isotropy assumption for worms. No constants are fitted in this paper.

assumptions (4)
  • domain assumption The polymer network exponent formula γ_G = ν[dV + (d−1)(V_S−1) − Σ(n_L x_L + n^S_L x^S_L)] − (N−1) is valid in all dimensions and for networks between parallel hyperplanes.
    Used in §2 to derive both the polygon rederivation and the bridge exponent. It is prior theory by the authors and collaborators, not reproved here.
  • ad hoc to paper A bridge can be represented as a one-chain network with one fixed surface vertex at the origin and one free surface vertex on a virtual parallel surface at maximal displacement.
    Introduced in §2, Eq. (7) and Figure 3. The mapping from the maximal-height endpoint to a virtual surface vertex is the new step; its validity is supported only by the polygon analogy and numerical agreement.
  • domain assumption The endpoint distribution of SAWs is radially symmetric at large n, so the probability that the endpoint lies in a fixed direction or hyperplane decays as n^{−ν}.
    Used in §3 for worms: the simple geometric argument for γ_w = γ − ν. It is a standard heuristic but not proved.
  • domain assumption The quoted critical exponents γ, γ_1, γ_{11}, ν, x_L, x^S_L from prior CFT, Monte Carlo and series work are correct.
    The relations are only as good as the input exponents; the paper does not recompute them.
invented entities (1)
  • Virtual parallel surface at maximal bridge span
    purpose: To recast a bridge as a two-surface network so Eq. (1) can be applied; the highest point of the bridge is treated as lying on this surface.
    A modeling device introduced in §2 and Figure 3. It has no direct physical handle beyond the numerical consistency of the resulting exponent, so independent evidence is absent.

how reviews work

0 comments
Cite this review

Pith. "Pith review of New scaling laws for self-avoiding walks: bridges and worms." pith.science (2026). https://pith.science/paper/F6VE62GP

@misc{pith2026190803872,
  author       = {Pith},
  title        = {Pith review of: New scaling laws for self-avoiding walks: bridges and worms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/F6VE62GP}},
  note         = {Machine review of arXiv:1908.03872}
}
abstract

We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$ to that of terminally-attached self-avoiding arches, $\gamma_{1,1},$ and the {correlation} length exponent $\nu.$ We find $\gamma_b = \gamma_{1,1}+\nu.$ We provide compelling numerical evidence for this result in both two- and three-dimensions. Another subset of SAWs, called {\em worms}, are defined as the subset of SAWs whose origin and end-point have the same $x$-coordinate. We give a scaling relation for the corresponding critical exponent $\gamma_w,$ which is $\gamma_w=\gamma-\nu.$ This too is supported by enumerative results in the two-dimensional case.

Figures

Figures reproduced from arXiv: 1908.03872 by the authors.

Figure 1
Figure 1. A polymer network G interacting with a surface. This network has 3 surface vertices, n S 1 = 1 with one leg, n S 3 = 2 with three legs; 6 bulk vertices, of which n1 = 3 have one line, n3 = 2 have three lines, and n4 = 1 has four lines attached. To eliminate overall translational invariance, one (and only one) vertex is fixed along the surface. The network has N = 10 lines. The intuitive meaning of formula (1) for su… view at source ↗
Figure 2
Figure 2. A polygon as a loop anchored in the surface (a), and as a watermelon with [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Identity (7) viewed as resulting from a “vertex algebra”: [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Identity (8) viewed as resulting from the above mentioned vertex algebra: [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Identity (9) viewed as resulting from the extended vertex algebra: All elements [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages

  1. [1]

    M N Barber, Scaling Relations for Critical Exponents of Surface Properties of Magnets, Phys. Rev. B 8 407–9, 1973

  2. [2]

    Bennett-Wood and A

    M T Batchelor, D. Bennett-Wood and A. L. Owczarek, Two-dimensional polymer networks at a mixed boundary: Surface and wedge exponents, Eur. Phys. Journal B, 5 139–142, 1998

  3. [3]

    M T Batchelor and H W J Bl¨ ote, Conformal invariance and critical behavior of the O(n) model on the honeycomb lattice, Phys. Rev. B 39 2391–2402, 1989

  4. [4]

    M T Batchelor and J Suzuki, Exact solution and surface critical behaviour of an O(n) model on the honeycomb lattice, J. Phys. A.: Math. Gen. 26 L729–L735, 1993

  5. [5]

    M T Batchelor and C M Yung, Exact Results for the Adsorption of a Flexible Self-Avoiding Polymer Chain in Two Dimensions, Phys. Rev. Lett. 74, 2026–2029, 1995

  6. [6]

    N R Beaton, M Bousquet-M´ elou, J de Gier, H Duminil-Copin and A J Guttmann, The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is 1 + √ 2. Commun. Math. Phys. 326, 727—754, 2014

  7. [7]

    J L Cardy, Conformal invariance and surface critical behavior, Nucl. Phys. B 240 [FS12]] 514–532, 1984

  8. [8]

    N Clisby, Calculation of the connective constant for self-avoiding walks via the pivot algorithm, J. Phys. A: Math. Theor. 46 245001, 2013

Show all 47 references
  1. [9]

    N Clisby, Accurate estimate of the critical exponent ν for self-avoiding walks via a fast implementation of the pivot algorithm, Phys. Rev. Lett. 104 (2010), 05570

  2. [10]

    N Clisby, Scale-free Monte Carlo method for calculating the critical exponent γ of self-avoiding walks. J. Phys. A: Math. Theor. 50 (2017) 264003. New scaling laws for self-avoiding walks: bridges and worms 12

  3. [11]

    N Clisby, A R Conway and A J Guttmann, Three-dimensional terminally attached self-avoiding walks and bridges, J. Phys. A.: Math. Theor. 49 015004, 2016

  4. [12]

    B Dyhr, M Gilbert, T Kennedy, G F Lawler and S Passon, The self-avoiding walk spanning a strip, J. Stat. Phys. 144, 1–22, 2011

  5. [13]

    C Domb and M S Green, Academic Press, Lonodon and New York, 76-267, 1986

    H W Diehl, Field-theoretical approach to critical behaviour at surfaces, in Phase Transitions and Critical Phenomena, Vol 10 , eds. C Domb and M S Green, Academic Press, Lonodon and New York, 76-267, 1986

  6. [14]

    H W Diehl and S Dietrich, Scaling laws and surface exponents from renormalization group equations, Phys. Lett. 80 A, 408–412, 1980

  7. [15]

    H W Diehl and S Dietrich, Field-theoretical approach to multicritical behavior near free surfaces, Phys. Rev. B 24, 2878–2880(R), 1981

  8. [16]

    Rev B 27, 2937–2954, 1983

    H W Diehl, S Dietrich and E Eisenriegler, Universality, irrelevant surface operators, and corrections to scaling in systems with free surfaces and defect planes, Phys. Rev B 27, 2937–2954, 1983

  9. [17]

    H W Diehl and M Shpot, Surface critical behavior in fixed dimensions d <4: Nonanalyticity of critical surface enhancement and massive field theory approach, Phys. Rev. Lett. 73, 3431–3434, 1994

  10. [18]

    H W Diehl and M Shpot, Massive field-theory approach to surface critical behavior in three- dimensional systems, Nucl. Phys. B 528 [FS] 595–647, 1998

  11. [19]

    B Duplantier, Polymer Network of Fixed Topology: Renormalization, Exact Critical Exponent γ in Two Dimensions, and d = 4−ε, Phys. Rev. Lett. 57, 941–944, 1986

  12. [20]

    B Duplantier and H Saleur, Exact Surface and Wedge Exponents for Polymers in Two Dimensions, Phys. Rev. Lett. 57, 3179–3182, 1986

  13. [21]

    B Duplantier, Statistical Mechanics of Polymer Networks of Any Topology, J. Stat. Phys. 54, 581–680, 1989

  14. [22]

    A Direct Renormalization Approach, Commun

    B Duplantier, Intersections of Random walks. A Direct Renormalization Approach, Commun. Math. Phys. 117, 279–329, 1988

  15. [23]

    Symposia Pure Math

    B Duplantier, Conformal fractal geometry & boundary quantum gravity, in Fractal Geometry and Applications: A Jubilee of Benoˆ ıt Mandelbrot, Proc. Symposia Pure Math. Vol. 72, Part 2, Michel L Lapidus and Machiel van Frankenhuijsen Editors, 365-482, 2004 (AMS, Providence, R.I.)

  16. [24]

    B Duplantier and I K Kostov, Conformal Spectra of Polymers on a Random Surface, Phys. Rev. Lett. 61, 1433–1437, 1988

  17. [25]

    B Duplantier and I K Kostov, Geometrical critical phenomena on a random surface of arbitrary genus, Nucl. Phys. B 340 [FS], 491–541, 1990

  18. [26]

    B Duplantier and K-H Kwon, Conformal Invariance and Intersections of Random Walks, Phys. Rev. Lett. 61, 2514–2517, 1988

  19. [27]

    B Duplantier, Random Walks and Quantum Gravity in Two Dimensions, Phys. Rev. Lett. 81, 5489–5492, 1998

  20. [28]

    P Fendley and H Saleur, Exact theory of polymer adsorption in analogy with the Kondo problem, J. Phys. A: Math. Gen. 27 L789–L796, 1994

  21. [29]

    C von Ferber, Y Holovatch, Copolymer networks and stars: Scaling exponents, Phys. Rev. E 56, 6370–6386, 1997

  22. [30]

    F Gliozzi, P Liendo, M Meineri, and A Rago, Boundary and interface CFTs from the conformal bootstrap, Journal of High Energy Physics, 2015(5):36

  23. [31]

    P Grassberger, Simulations of grafted polymers in a good solvent, J. Phys. A.: Math. Gen. 38 323–332, 2005

  24. [32]

    I Guim and T W Burkhardt, Transfer-matrix study of the adsorption of a flexible self-avoiding polymer chain in two dimensions, J. Phys. A: Math. Gen. 22 1131–1140, 1989

  25. [33]

    A J Guttmann and G M Torrie, Critical behaviour at an edge for the SAW and Ising model, J. Phys. A.: Math. Theor. 17 3539–3552, 1984

  26. [34]

    J M Hammersley and K W Morton J. Roy. Stat. Soc. B 16 23–38, 1954. New scaling laws for self-avoiding walks: bridges and worms 13

  27. [35]

    Oxford 13 108–110, 1962

    J M Hammersley, and D J A Welsh, Further results on the rate of convergence to the connective constant of the hypercubical lattice, The Quarterly Journal of Mathematics. Oxford 13 108–110, 1962

  28. [36]

    J M Hammersley, The number of polygons on a lattice, Proceedings of the Cambridge Philosophical Society 57, 516–523, 1961

  29. [37]

    R Hegger and P Grassberger, J. Phys. A: Math. Gen 27, 4069–4081, 1994

  30. [38]

    L I Klushin, A A Polotsky, H-P Hsu, D A Markelov, K Binder and A M Skvortsov, Adsorption of a single polymer chain on a surface: Effects of the potential range. Phys. Rev. E 87 022604, 2013

  31. [39]

    187, 237–273, 2001

    G F Lawler, O Schramm and W Werner, Values of Brownian intersection exponents, I: Half-plane exponents, Acta Math. 187, 237–273, 2001

  32. [40]

    187, 275–308, 2001

    G F Lawler, O Schramm and W Werner, Values of Brownian intersection exponents, II: Plane exponents, Acta Math. 187, 275–308, 2001

  33. [41]

    B Nienhuis, Exact Critical Point and Critical Exponents ofO(n) Models in Two Dimensions, Phys. Rev. Lett. 49 1062-1065, 1982; Critical Behavior of Two-Dimensional Spin Models and Charge Asymmetry in the Coulomb Gas, J. Stat. Phys. 34, 731–761, 1984

  34. [42]

    B Nienhuis, Two-dimensional critical phenomena and the Coulomb Gas, in Phase Transitions and Critical Phenomena, Vol. 11, C. Domb and J.L. Lebowitz, eds. (Academic Press, London, 1987)

  35. [43]

    J Reeve and A J Guttmann, Renormalisation group calculations of the critical exponents of the n-vector model with a free surface, J. Phys. A: Math. Gen. 14 3357–3366, 1981

  36. [44]

    J S Reeve, Renormalisation group calculation of the critical exponents of the special transition in semi-infinite systems, Phys. Lett. 81A, 237–238, 1981

  37. [45]

    H Saleur, New exact critical exponents for 2d self-avoiding walks, J. Phys. A: Math. Gen. 19, L807–810, 1986

  38. [46]

    H Saleur, Conformal invariance for polymers and percolation, J. Phys. A: Math. Gen. 20, 455–470, 1987

  39. [47]

    L Sch¨ afer, C von Ferber, U Lehr, and B Duplantier, Renormalization of polymer networks and stars, Nucl. Phys. B [FS] 374(3), 473–495, 1992

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.