Papers
Topics
Authors
Recent
Search
2000 character limit reached

Existence and bounds of growth constants for restricted walks, surfaces, and generalisations

Published 4 Sep 2025 in math.CO and cond-mat.stat-mech | (2509.04568v1)

Abstract: We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They are analogous to osculating polygons introduced in (Jensen and Guttmann, 1998) except that they are not required to be closed. The 'automata' method of (P\"onitz and Tittmann, 2000) can be adapted to such restricted walks. For example, we prove upper bounds for the connective constant for SOWs on the square and triangular lattices to be μ<sup>SOW□</sup>≤2.73911\mu<sup>{\mathrm{SOW}}_\square</sup> \leq 2.73911 and μ<sup>SOW△</sup>≤4.44931\mu<sup>{\mathrm{SOW}}_\triangle</sup> \leq 4.44931, respectively. In analogy, we also introduce self-osculating surfaces (SOSs), a superset of self-avoiding surfaces (SASs) which can be generated from fixed polyominoids (XDs). We further generalise and define self-avoiding kk-manifolds (SAMs) and its supersets, self-osculating kk-manifolds (SOMs) in the dd-dim hypercubic lattice and (d,k)(d, k)-XDs. By adapting the concatenation procedure procedure (van Rensburg and Whittington, 1989), we prove that their growth constants exist, and prove an explicit form for their upper and lower bounds. The upper bounds can be improved by adapting the 'twig' method, originally developed for polyominoes (Eden, 1961, Klarner and Rivest, 1973). For the cubic lattice, we find improved upper bounds for the growth constant of SASs as μ<sup>SASZ<sup>3</sup></sup>≤17.11728\mu<sup>{\mathrm{SAS}}_{\mathbb{Z}<sup>3}</sup></sup> \leq 17.11728.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.