Skip to Main content Skip to Navigation
New interface
Conference papers

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 metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 9:28:36 AM
Last modification on : Sunday, April 26, 2020 - 1:34:02 PM
Long-term archiving on: : Saturday, January 2, 2016 - 10:49:39 AM


Publisher files allowed on an open archive




Axel Bacher, Nicholas R. 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, ⟨10.46298/dmtcs.2445⟩. ⟨hal-01207571⟩



Record views


Files downloads