Related papers: Borel type bounds for the self-avoiding walk conne…
We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property…
The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be…
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact…
We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…
The Hammersley-Welsh bound (1962) states that the number $c_n$ of length $n$ self-avoiding walks on $\mathbb{Z}^d$ satisfies \[ c_n \leq \exp \left[ O(n^{1/2}) \right] \mu_c^n, \] where $\mu_c=\mu_c(d)$ is the connective constant of…
Let $c_n = c_n(d)$ denote the number of self-avoiding walks of length $n$ starting at the origin in the Euclidean nearest-neighbour lattice $\mathbb{Z}^d$. Let $\mu = \lim_n c_n^{1/n}$ denote the connective constant of $\mathbb{Z}^d$. In…
A modification of perturbation theory, known as delta-expansion (variationally improved perturbation), gave rigorously convergent series in some D=1 models (oscillator energy levels) with factorially divergent ordinary perturbative…
For $d \geq 2$ and $n \in \mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\lim_{n \in…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number $\sigma_{n}$ of self-avoiding walks of length $n$ in $G$ from a given vertex. We prove a formula for the connective constant for free products of…
Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…
We establish the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point $n \vec{a}$ for $\vec{a}$ in $Z^d$, as $n$ increases to infinity.
In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…
We prove that self-avoiding walk on Z^d is sub-ballistic in any dimension d at least two. That is, writing ||u|| for the Euclidean norm of u \in Z^d, and SAW_n for the uniform measure on self-avoiding walks gamma:{0,...,n} \to Z^d for which…
We prove a sufficient condition for the two-point function of a statistical mechanical model on $\mathbb{Z}^d$, $d > 2$, to be bounded uniformly near a critical point by $|x|^{-(d-2)} \exp [ -c|x| / \xi ]$, where $\xi$ is the correlation…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying…
We give an explicit demonstration that the derivative expansion of the QED effective action is a divergent but Borel summable asymptotic series, for a particular inhomogeneous background magnetic field. A duality transformation B\to iE…
The aim of this paper is to continue the study of asymptotic expansions and summability in a monomial in any number of variables. In particular we characterize these expansions in terms of bounded derivatives and we develop tauberian…
The well-known algorithm for summing of divergent series is based on the Borel transformation in combination with the conformal mapping (Le Guillou and Zinn-Justin, 1977). Modification of this algorithm allows to determine a strong coupling…
We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…
Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…