Related papers: Enumeration of the self-avoiding polygons on a lat…
We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour…
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…
Exactly solvable models of planar polygons, weighted by perimeter and area, have deepened our understanding of the critical behaviour of polygon models in recent years. Based on these results, we derive a conjecture for the exact form of…
We present a multiplication algorithm to recursively construct vertices for the Schroedinger functional in the abelian background field case. The algorithm is suited for automatic perturbative calculations with a variety of actions. As…
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…
We propose a stochastic method for solving Schwinger-Dyson equations in large-N quantum field theories. Expectation values of single-trace operators are sampled by stationary probability distributions of the so-called nonlinear random…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
The dynamics of Wilson loops are governed by an infinite set of Schwinger-Dyson equations and trace relations. In the context of the lattice positivity bootstrap, a central challenge is determining a dynamically independent basis of these…
We present an expression for the generating function of correlation functions of the sine-Gordon integrable field theory on a cylinder, with compact space. This is derived from the Destri-De Vega integrable lattice regularization of the…
We consider off-diagonal correlation functions of impenetrable bosons on a lattice. By using the Jordan-Wigner transformation the one-body density matrix is represented as (Toeplitz) determinant of a matrix of fermionic Green functions.…
We use the finite lattice method to calculate the radius of gyration, the first and second area-weighted moments of self-avoiding polygons on the square lattice. The series have been calculated for polygons up to perimeter 82. Analysis of…
This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…
In a recent preprint, Lai and Rohatgi compute the generating functions of lozenge tilings of "quartered hexagons with dents" by applying the method of "graphical condensation". The purpose of this note is to exhibit how (a generalization…
We study the Schwinger model on a lattice consisting of zeros of the Hermite polynomials that incorporates a lattice derivative and a discrete Fourier transform with many properties. Such a lattice produces a Klein-Gordon equation for the…
The statistics of nested spiral self-avoiding loops, which is closely related to the partition of integers into decreasing parts, is studied on the square and triangular lattices.
We analyze new data for self-avoiding polygons, on the square and triangular lattices, enumerated by both perimeter and area, providing evidence that the scaling function is the logarithm of an Airy function. The results imply universal…
The Wigner functions on the one dimensional lattice are studied. Contrary to the previous claim in literature, Wigner functions exist on the lattice with any number of sites, whether it is even or odd. There are infinitely many solutions…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…