Weakly prudent self-avoiding bridges - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

Weakly prudent self-avoiding bridges

(1) , (2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
dmAT0171.pdf (576.06 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01207571 , version 1 (01-10-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
61 View
463 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More