Weakly directed self-avoiding walks

Axel Bacher (1) , Mireille Bousquet-Mélou (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. This series has a complex singularity structure and in particular, is not D-finite. The growth constant is approximately 2.54 and is thus larger than that of all natural families of SAW enumerated so far (but smaller than that of general SAW, which is about 2.64). We also prove that the end-to-end distance of weakly directed walks grows linearly. Finally, we study a diagonal variant of this model.

Mots clés: Enumeration; Self-avoiding walks

Domaines: Combinatoire [math.CO]

Axel Bacher, Mireille Bousquet-Mélou. Weakly directed self-avoiding walks. Journal of Combinatorial Theory, Series A, 2011, 118 (8), pp.2365-2391. ⟨hal-00526784v2⟩