Related papers: Scaling function and universal amplitude combinati…
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 analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…
Exactly solvable two-dimensional polygon models, counted by perimeter and area, are described by $q$-algebraic functional equations. We provide techniques to extract the scaling behaviour of these models up to arbitrary order and apply them…
It is shown that a recently conjectured form for the critical scaling function for planar self-avoiding polygons weighted by their perimeter and area also follows from an exact renormalization group flow into the branched polymer problem,…
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…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…
Punctured polygons are polygons with internal holes which are also polygons. The external and internal polygons are of the same type, and they are mutually as well as self-avoiding. Based on an assumption about the limiting area…
We present full analytic results for the four-point one-loop amplitude of a conformally coupled scalar in four-dimensional Anti-de-Sitter space dual to a primary operator with scaling dimension 1. The computation is based on an intriguing…
We discuss the asymptotic behaviour of models of lattice polygons, mainly on the square lattice. In particular, we focus on limiting area laws in the uniform perimeter ensemble where, for fixed perimeter, each polygon of a given area occurs…
The analysis of the radial distribution function of a system provides a possible procedure for uncovering interaction rules between individuals out of collective movement patterns. This approach from classical statistical mechanics has…
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 present a set of algebraic functions for evaluating the coefficients of the scalar integral basis of a general one-loop amplitude. The functions are derived from unitarity cuts, but the complete cut-integral procedure has been carried…
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…
Phenomenological scaling arguments suggest the existence of universal amplitudes in the finite-size scaling of certain correlation lengths in strongly anisotropic or dynamical phase transitions. For equilibrium systems, provided that…
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…
We study scaling function geometry. We show the existence of the scaling function of a geometrically finite one-dimensional mapping. This scaling function is discontinuous. We prove that the scaling function and the asymmetries at the…
We show that the entanglement entropy and alpha entropies corresponding to spatial polygonal sets in $(2+1)$ dimensions contain a term which scales logarithmically with the cutoff. Its coefficient is a universal quantity consisting in a sum…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
Unlike in complex linear operator theory, polynomials or, more generally, Laurent series in antilinear operators cannot be modelled with complex analysis. There exists a corresponding function space, though, surfacing in spectral mapping…