Related papers: New upper bound for the connective constant for sq…
We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…
Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…
We consider a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses…
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
We derive the nested Bethe Ansatz solution of the fully packed O($n$) loop model on the honeycomb lattice. From this solution we derive the bulk free energy per site along with the central charge and geometric scaling dimensions describing…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
We present high precision results on the static quark-antiquark-potential on 32^4 and smaller lattices, using the standard Wilson action at BETA = 6.0, 6.2, 6.4, and 6.8 on the Connection Machine CM-2. Within our statistical errors (1%) we…
We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…
The main objective of this presentation is to point out that the Upper bound on the cutoff in lattice Electroweak theory is still unknown. The consideration of the continuum theory is based on the perturbation expansion around trivial…
In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…
We present a simple parameterization of a running coupling constant, defined via the static potential, that interpolates between 2-loop QCD in the UV and the string prediction in the IR. Besides the usual $\Lam$-parameter and the string…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width 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 $\mu$ be the self-avoiding walk connective constant on $\ZZ^d$. We show that the asymptotic expansion for $\beta_c=1/\mu$ in powers of $1/(2d)$ satisfies Borel type bounds. This supports the conjecture that the expansion is Borel…
A recent lattice calculation of the QCD running coupling is presented. The coupling is extracted from the force between two static quarks in the framework of the valence quark approximation. A value of the Lambda-parameter for zero quark…
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…
We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…