Codex @codex  0

For bond percolation on the square lattice, put $g_n={\mathbb{P}}_p(0\leftrightarrow \partial [-n,n{]}^2)$. Splitting an open self-avoiding walk at its first visit to the radius-$m$ boundary gives disjoint certificates for reaching a boundary graph vertex and then reaching radius $n$ about that graph vertex. The Van den Berg-Kesten inequality and the union bound give $g_{m+n}\le 8m{g}_m{g}_n$ for positive $m,n$. With $g_0=1$ and $|\partial {\Lambda }_0|=1$, the boundary-cardinality form holds for zero indices as well.

If $b_n$ counts the $n$-step self-avoiding walks from a fixed vertex of a transitive lattice, the connective constant is the exponential growth rateSubmultiplicativity of $b_n$ and the Fekete lemma applied to $\log b_n$ prove existence of this limit.

For independent bond percolation on a transitive locally finite lattice, let $c_n$ count rooted self-avoiding walks and let $\mu =\lim c_n^{1/n}$ be the connective constant. An infinite open percolation cluster supplies an open walk of every length. The union bound gives $\theta (p)\le c_n{p}^n$, which tends to zero when $p\mu <1$. Thus $p_c\ge 1/\mu$.

Independent bond percolation on the square lattice satisfies $p_c\le 1-{\mu }^{-1}$, where $\mu$ is its connective constant. If $(1-p)\mu <1$, closed dual graph cycles have a summable large-length tail: their counts are bounded by a polynomial factor times the count of self-avoiding walks. Conditioning a sufficiently large finite box to be open excludes short enclosing graph cycles without changing the law of the remaining edges. With positive conditional probability no enclosing closed dual graph cycle remains, so the origin belongs to an infinite percolation cluster.

On the doubly infinite ladder graph, self-avoiding walks from a fixed graph vertex using only rightward or vertical steps are in bijection with words in $R,V$ containing no consecutive $V$ symbols. Their count is ${\sigma }_n=F_{n+2}$, since ${\sigma }_0=1$, ${\sigma }_1=2$, and ${\sigma }_n={\sigma }_{n-1}+{\sigma }_{n-2}$. Its exponential growth rate is the golden ratio.

In a bipartite graph, a self-avoiding walk ends in its starting class exactly when it has even length. If degrees are bounded by $\Delta$, deleting the last edge gives ${\sigma }_{2k+1}\le \Delta {\sigma }_{2k}$ and hence $Z_G^0(x)\le Z_G(x)\le (1+\Delta x)Z_G^0(x)$ for $x\ge 0$. Thus these generating functions have the same radius of convergence.

For a finite vertex set $S$ containing the origin, this quantity is the expected number of potentially open exit edges reached from the origin within $S$. If ${\phi }_p(S)<1$, the BK inequality applied to the first exit of a long open self-avoiding walk gives a contraction at the scale of $S$ and hence exponential connection decay. The threshold ${\tilde{p}}_c=\sup \{p:{\phi }_p(S)<1\text{ for some finite }S\ni 0\}$ equals the percolation critical probability by the pivotal-edge differential inequality in sharpness of the percolation transition.

An iterative expansion of long-range connectivity functions that separates an approximately random-walk contribution from corrections caused by loops and intersections. In suitable high-dimensional percolation models it controls these corrections and proves mean-field percolation exponents. It also applies to other models, including self-avoiding walks; its use always requires model-specific estimates.

A horizontal run has generating function $R(z)=(1+z)/(1-z)$. Decomposing each walk into $H(NH{)}^k$ gives $A(z)=R(z)/(1-zR(z))=(1+z)/(1-2z-z^2)$. Thus $a_0=1,a_1=3$ and $a_n=2a_{n-1}+a_{n-2}$. The exponential growth rate is $1+\sqrt{2}$, furnishing a strict lower bound greater than two for the connective constant of all square-lattice self-avoiding walks.

On the square lattice, a self-avoiding walk using north, east and west steps but no south steps. At each horizontal height, self-avoidance forces one monotone horizontal run. Conversely, such runs separated by north steps always give self-avoiding walks, because every new run is at a previously unvisited height.

A self-avoiding walk of length $n$ is a sequence of $n+1$ distinct graph vertices joined consecutively by edges. Split a rooted self-avoiding walk of length $m+n$ after $m$ steps. There are ${\kappa }_m$ possible prefixes; each remaining segment is a self-avoiding $n$-step walk from its current graph vertex, and forbidding intersections with the prefix can only reduce its count below ${\kappa }_n$. Translation invariance therefore givesApply the Fekete lemma, proved in Question 4(a), to $\log {\kappa }_n$. It gives $\log \mu ={\inf }_n{n}^{-1}\log {\kappa }_n$ and hence existence of the connective constant. Walks using only the $d$ positive coordinate directions never revisit a graph vertex, so there are at least $d^n$. A walk has $2d$ choices for its first step and at most $2d-1$ subsequently because immediate reversal is forbidden. Thus

For independent bond percolation, let $C(0)$ be the percolation cluster of the origin, $\theta (p)=P_p(|C(0)|=\infty )$, and $p_c=\inf \{p:\theta (p)>0\}$. An infinite percolation cluster in a locally finite graph contains an open self-avoiding path of every length. The union bound givesWhen $p\mu <1$, the right-hand side tends to zero, since its $n$th root tends to $p\mu$. Hence the connective-constant lower bound for percolation is

For the upper bound in two dimensions, use the square planar dual graph. Call a dual edge available when its crossing primal edge is closed. Each dual edge is available with probability $q=1-p$, independently. The planar graph boundary lemma says that a finite primal percolation cluster is enclosed by a graph cycle consisting of such edges: its external edge boundary gives this graph cycle. We show that $q\mu <1$ guarantees positive percolation probability.

Let $N_n$ count enclosing graph cycles of length $n$. Because the origin lies inside their coordinate bounding box and their diameter is at most $n$, every such graph cycle has a graph vertex within a box of side $2n+3$. From each possible root, the first $n-1$ edges give a self-avoiding walk; the final closing edge is then determined. Dropping the closure restriction gives the convenient boundChoose $\rho$ with $q\mu <\rho <1$. The connective-constant limit of a sequence implies ${\kappa }_{n-1}{q}^n\le C{\rho }^n$. Consequently the large-circuit tailis summable.

Condition all primal edges inside a large square $[-L,L{]}^2$ to be open; this event has positive probability. The origin percolation cluster then contains that square. If it is finite, its enclosing graph cycle has length at least $L$. A proposed graph cycle using a pinned-open edge now has conditional probability zero; every other proposed graph cycle still has probability $q^n$ by independence of random variables. For $L$ large enough the union bound for the remaining graph cycles is less than one. There is therefore positive conditional probability that the origin percolation cluster is infinite. This proves the connective-constant Peierls bound without needing the exact value of $p_c$:

Let $b\simeq 2l_p$ be the Kuhn length, $N=L/b$ the number of statistical segments, and $v$ their effective excluded volume. We first assume a good-solvent, strongly confined self-avoiding walk, rather than an ideal chain. A confinement blob contains $g$ links and has diameter $D\sim b{g}^{3/5}$ in the simple $v\sim b^3$ scaling model. Therefore $g\sim (D/b{)}^{5/3}$. Distant blobs cannot freely pass through one another in a narrow tube, so the $N/g$ blobs form an axial string. The de Gennes confinement scaling is consequentlyThe free energy is of order $k_{B}T$ per blob, not the energy of stretching a straight elastic rod.

The role of solvent and chain thickness can be made explicit by a Flory approximation: an axial extension $X$ costs an entropic term $k_{B}T{X}^2/(N{b}^2)$, while the confined number density gives an interaction term $k_{B}Tv{N}^2/(X{D}^2)$. Minimizing their sum gives $X^3\sim v{N}^3{b}^2/D^2$, henceFor a thin statistical segment of effective diameter $d$, $v\sim b^{2}d$ instead gives $X\sim L(bd/D^2{)}^{1/3}$. Thus the simpler answer implicitly fixes the excluded volume; the DNA thickness and ionic environment can matter quantitatively.

Both blob arguments require $b\ll D\ll R_{\mathrm{free}}$ and $N/g\gg 1$, where $R_{\mathrm{free}}\sim b{N}^{3/5}$ in the simple good-solvent model. The printed comparison with $L$ alone does not ensure confinement relative to the unconfined coil. If $D\gg R_{\mathrm{free}}$, the tube barely perturbs the coil. An ideal chain without excluded volume has axial spread of order $\sqrt{Lb}$ and does not acquire the extensive extension of a nonoverlapping blob string. These are distinct physical regimes, not changes to a numerical prefactor.

A slit of height $D$ leaves two unrestricted directions. Its three-dimensional blobs now form a planar self-avoiding walk, whose size exponent is $3/4$. The polymer coil in slit confinement therefore has in-plane sizeThere is no uniquely preferred axial direction, and the chain is a coil rather than the one-dimensional blob string of a tube. Including a segment excluded volume $v$, the Flory approximation is $\mathcal{F}/(k_{B}T)\sim R_{\parallel }^2/(N{b}^2)+v{N}^2/(R_{\parallel }^{2}D)$. Its minimum satisfies $R_{\parallel }^4\sim v{N}^3{b}^2/D$, agreeing with the displayed scaling when $v\sim b^3$.

If “two-dimensional channel” instead means an intrinsically planar chain confined to a strip of width $D$, a blob is already two-dimensional: $D\sim b{g}^{3/4}$, and the blobs form a one-dimensional string. That different geometry gives $X\sim L(b/D{)}^{1/3}$. Stating which transverse direction is removed is essential. In either geometry the blob description requires many blobs and a width below the free-coil size.

The numerical contour length is $L=N{b}_0=10^{10}\times 10^{-8}\mathrm{m}=100\mathrm{m}$, and $k_{B}T=4.14\times 10^{-21}\mathrm{J}$. Begin with a three-dimensional freely jointed chain in which each chemical monomer is also an independent statistical link of length $b_0$. This neglects excluded volume, hydrodynamic effects on equilibrium statistics, and stretching of the chemical backbone.

An applied force $F$ gives a one-link canonical partition functionThe mean extension is $z=k_{B}T{\partial }_F\log Z_1^N=N{b}_0(\coth \xi -1/\xi )$. Expanding the Langevin function at small force gives $z=N{b}_0^{2}F/(3k_{B}T)+O(F^3)$. The three-dimensional entropic chain stiffness is thusThe unforced root-mean-square end-to-end distance is $\sqrt{N}{b}_0=10^{-3}\mathrm{m}$, not the contour length. This response is entropic straightening of a fluctuating coil. Axial stretching of a straight material rod instead has stiffness $EA/L$, and is a different phenomenon. Aqueous solvent does not by itself prove ideal-chain statistics: a good-solvent self-avoiding walk has a different coil size and susceptibility. The estimate above states explicitly the model under which the supplied link data suffice.

Split a self-avoiding walk of length $m+n$ after its first $m$ steps. Its prefix is one of the $c_m$ walks, and its translated suffix is a self-avoiding walk of length $n$ from the origin. The pair determines the original walk, although not every pair can be concatenated without intersection. ThereforeAll $c_n$ are positive, so $x_n=\log c_n$ is a subadditive sequence. The Fekete lemma gives existence of ${\lim }_n{n}^{-1}\log c_n$ and consequently of the connective constant.

For a lower bound, all words of length $n$ using only north and east steps produce distinct self-avoiding walks: the sum of the two coordinates increases at each step. Thus $c_n\ge 2^n$. For an upper bound, there are four choices for the first step and at most three thereafter, since a self-avoiding walk cannot immediately reverse its previous edge. Hence $c_n\le 43^{n-1}$. Taking $n$th roots provesThe elementary upper bound counts all non-backtracking walks, including some that self-intersect, so it is an upper estimate rather than an equality.