Discrete Mathematics & Theoretical Computer Science |

- 1 Research Institute for Symbolic Computation
- 2 Department of Mathematics and Statistics [Melbourne]
- 3 Australian Research Council Centre of Excellence for Mathematics and Statistics of Complex Systems, Australia

We define and enumerate a new class of self-avoiding walks on the square lattice, which we call <i>weakly prudent bridges</i>. 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.

Source: HAL:hal-01207571v1

Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)

Section: Proceedings

Published on: January 1, 2014

Imported on: November 21, 2016

Keywords: self-avoiding walks,enumeration,analytic combinatorics,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

This page has been seen 260 times.

This article's PDF has been downloaded 198 times.