Asymptotic counts for the walk multiples of self-avoiding polygons on lattices using sieves (original) (raw)
Related papers
Asymptotic counts for the walk multiples of self-avoiding polygons on lattices using sieves 1
Counting walks by their last erased self-avoiding polygons using sieves
2021
Square Lattice Self-Avoiding Walks and Polygons
Annals of Combinatorics, 2001
Self-avoiding walks and polygons on the triangular lattice
Journal of Statistical Mechanics: Theory and Experiment, 2004
Self-avoiding polygons on the square lattice
Journal of Physics A: Mathematical and General, 1999
Self-avoiding walks and trails on the 3.12 lattice
2004
Self-avoiding walks and trails on the 3.12 2 lattice
Journal of Physics A: Mathematical and General, 2005
Staircase polygons and recurrent lattice walks
Physical Review E, 1993
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory, Series A, 2011
Enumeration of self-avoiding walks on the square lattice
Journal of Physics A: Mathematical and General, 2004
On the non-universality of a critical exponent for self-avoiding walks
Nuclear Physics B, 1998
Quenched Averages for Self-Avoiding Walks and Polygons on Deterministic Fractals
Journal of Statistical Physics, 2006
Journal of Physics A: Mathematical and Theoretical, 2009
Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area
Discrete Mathematics & Theoretical Computer Science, 2006
Self-avoiding walks and polygons on quasiperiodic tilings
Journal of Physics A: Mathematical and General, 2003
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science, 2003
Explicit Formulas for Enumeration of Lattice Paths: Basketball and the Kernel Method
Lattice Path Combinatorics and Applications, 2019
New exponent in self-avoiding walks
Zeitschrift f�r Physik B Condensed Matter, 1984
Deterministic random walks on the integers
European Journal of Combinatorics, 2007
Bijective counting of Kreweras walks and loopless triangulations
Journal of Combinatorial Theory, Series A, 2007
Self-avoiding polygons — towards an exact solution?
Nuclear Physics B - Proceedings Supplements, 1988
Walks on graphs and lattices – effective bounds and applications
Forum Mathematicum, 2009
Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
Journal of Physics A: Mathematical and General, 1998
Proof of Ira Gessel's lattice path conjecture
Punctured polygons and polyominoes on the square lattice
Journal of Physics A: Mathematical and General, 2000
The Range of a Simple Random Walk on mathbbZ\mathbb{Z}mathbbZ: An Elementary Combinatorial Approach
The Electronic Journal of Combinatorics
Self-avoiding walks crossing a square
Journal of Physics A: Mathematical and General, 2005
Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
Journal of Physics A: Mathematical and General, 2004
Distribution of sizes of erased loops for loop-erased random walks
Physical Review E, 1997
Two-guard walkability of simple polygons
1998
Return probability for the loop-erased random walk and mean height in sandpile: a proof
Arxiv preprint arXiv:1106.5453, 2011
Self-avoiding random walks on lattice strips
Proceedings of the National Academy of Sciences, 1979
Self‐avoiding random walks: Some exactly soluble cases
Journal of Mathematical Physics, 1978