Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let be the connective constant of Problem 528, the limit of where counts the -step self-avoiding walks from the origin in . The theorem of H. Kesten, On the number of self-avoiding walks. II, states that
The paper compares with the growth constant of the walks that may revisit a point only after more than steps, proves as , 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 as : the leading term , the correction and the order of the remainder. Not covered: the value of for any fixed ; no 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.