Related papers: New upper bound for the connective constant for sq…
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
The properties of antiferromagnetic Heisenberg $S=\frac{1}{2}$ ladders with 2, 3, and 4 chains are expanded in the ratio of the intra- and interchain coupling constants. A simple mapping procedure is introduced to relate the 4 and 2-chain…
We investigate the probability for appearance of knots in self-avoiding loops (SALs) on a cubic lattice. A set of N-step loops is generated by attempting to combine pairs of (N/2)-step self-avoiding walks constructed by a dimerization…
The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…
The looping constant $\xi(Z^d)$ is the expected number of neighbors of the origin that lie on the infinite loop-erased random walk in $Z^d$. Poghosyan, Priezzhev and Ruelle, and independently, Kenyon and Wilson, proved recently that…
We study the dynamics of SU(2) gauge theory with NF=6 Dirac fermions by means of lattice simulation to investigate if they are appropriate to realization of electroweak symmetry breaking. The discrete analogue of beta function for the…
We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…
We present a high order perturbative computation of the renormalization constants Z_V, Z_A and of the ratio Z_P/Z_S for Wilson fermions. The computational setup is the one provided by the RI'-MOM scheme. Three- and four-loop expansions are…
The lattice stick number $s_L(K)$ of a knot $K$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $K$ in the cubic lattice. In this paper, we find an upper bound on the lattice stick…
We have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
In a recent paper by Beaton et al, it was proved that a model of self-avoiding walks on the honeycomb lattice, interacting with an impenetrable surface, undergoes an adsorption phase transition when the surface fugacity is $1+\sqrt{2}$.…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin,…
We determine the one-loop correction to the anisotropy factor for the square Symanzik improved lattice action, extracted fromthe finite volume effective action for SU(N) gauge theories in the background of a zero-momentum gauge field. The…
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…
The Stanley-Wilf limit of the pattern 1324 is known to lie between 10.271 and 13.5. We obtain lower bounds on this limit by encoding permutations as walks in directed graphs: building a permutation by successive insertion of maxima…
We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…
We study the cascading failures in a system composed of two interdependent square lattice networks A and B placed on the same Cartesian plane, where each node in network A depends on a node in network B randomly chosen within a certain…
The scaling behavior of pure gauge SU(3) in the region $\beta=5.85 - 7.60$ is examined by a Monte Carlo Renormalization Group analysis. The coupling shifts induced by factor 2 blocking are measured both on 32$^4$ and 16$^4$ lattices with…