Weakly prudent self-avoiding bridges

Abstract : We define and enumerate a new class of self-avoiding walks on the square lattice, which we call weakly prudent bridges. Their definition is inspired by two previously-considered classes of self-avoiding walks, and can be viewed as a combination of those two models. We consider several methods for recursively generating these objects, each with its own advantages and disadvantages, and use these methods to solve the generating function, obtain very long series, and randomly generate walks of arbitrary size. We find that the growth constant of these walks is approximately 2.58, which is larger than that of any previously-solved class of self-avoiding walks.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01207571
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, October 1, 2015 - 9:28:36 AM
Last modification on : Tuesday, March 7, 2017 - 3:25:34 PM
Long-term archiving on : Saturday, January 2, 2016 - 10:49:39 AM

File

dmAT0171.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01207571, version 1

Collections

Citation

Axel Bacher, Nicholas Beaton. Weakly prudent self-avoiding bridges. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.827-838. ⟨hal-01207571⟩

Share

Metrics

Record views

103

Files downloads

356