Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Let CkC_k be the connective constant of Problem 528, the limit of f(n,k)1/nf(n,k)^{1/n} where f(n,k)f(n,k) counts the nn-step self-avoiding walks from the origin in Zk\mathbb{Z}^k. The theorem of H. Kesten, On the number of self-avoiding walks. II, states that

Ck=2k−1−12k+O ⁣(1k2)(k→∞).C_k=2k-1-\frac{1}{2k}+O\!\left(\frac{1}{k^2}\right)\qquad(k\to\infty).

The paper compares CkC_k with the growth constant βk,2r\beta_{k,2r} of the walks that may revisit a point only after more than 2r2r steps, proves βk,2r−Ck=O(k−r)\beta_{k,2r}-C_k=O(k^{-r}) as k→∞k\to\infty, and reads the expansion off this comparison; the abstract states both results in this form. The site's commentary credits the expansion to Kesten under its key [Ke63], which resolves to the first paper of the series (J. Math. Phys. 4 (1963), 960--969); that paper proves the ratio limit of the walk counts, and Clisby, Liang and Slade, whose [[problems/discrete_geometry/E0528/claims/2007_08_21_clisby_liang_slade|later expansion]] extends this one, cite the 1964 sequel for it. The problem page annotates the key.

Covers. The first terms of the asymptotic expansion of CkC_k as k→∞k\to\infty: the leading term 2k−12k-1, the correction −1/(2k)-1/(2k) and the order O(k−2)O(k^{-2}) of the remainder. Not covered: the value of CkC_k for any fixed k≥2k\ge2; no CkC_k is determined, and the problem's question is not answered.

Depends on. Nothing in this wiki; the claim rests on the cited paper.

Acceptance. Refereed: H. Kesten, On the number of self-avoiding walks. II, J. Math. Phys. 5 (1964), no. 8, 1128--1137. The site's commentary records the expansion, but the site labels the problem OPEN, so that remark is not acceptance of the problem and the page lists no reviewed evidence. The proof is not compiled in this corpus.

Dating. The page is dated by the issue month in the publisher's record, August 1964; the day is a placeholder.