Results 1 to 10 of about 35,570 (198)
Self-avoiding walks and polygons on the triangular lattice [PDF]
, 2004 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.
Caracciolo S +24 more
core +2 more sources
Punctured polygons and polyominoes on the square lattice [PDF]
, 2000 We use the finite lattice method to count the number of punctured staircase and self-avoiding polygons with up to three holes on the square lattice. New or radically extended series have been derived for both the perimeter and area generating functions ...
Anthony J Guttmann +24 more
core +1 more source
On the enumeration of closures and environments with an application to random generation [PDF]
, 2019 Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables.
Bendkowski, Maciej, Lescanne, Pierre
core +3 more sources
Combinatorics of bicubic maps with hard particles [PDF]
, 2005 We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps ...
Ambjørn J +22 more
core +7 more sources
Universality and Exact Finite-Size Corrections for Spanning Trees on Cobweb and Fan Networks [PDF]
, 2019 Universality is a cornerstone of theories of critical phenomena. It is well understood in most systems especially in the thermodynamic limit. Finite-size systems present additional challenges.
Blöte +10 more
core +3 more sources
Asymptotic formulas for stacks and unimodal sequences [PDF]
, 2013 We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized Ferrer ...
Bringmann, Kathrin, Mahlburg, Karl
core +2 more sources
Polyominoes with nearly convex columns: An undirected model [PDF]
, 2009 Column-convex polyominoes were introduced in 1950's by Temperley, a mathematical physicist working on "lattice gases". By now, column-convex polyominoes are a popular and well-understood model.
Feretic, Svjetlan, Guttmann, Anthony J.
core +3 more sources
A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
, 2011 We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice.
Conway A R +11 more
core +1 more source
First Passage Time in a Two-Layer System
, 1994 As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities.
F. A. L. Dullien +15 more
core +1 more source
Statistics of lattice animals (polyominoes) and polygons [PDF]
, 2000 We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the growth constant ...
+24 more
core +1 more source