2025/09/04 by Sang‐Bum Kim, Kim, Sun Woo P., Pinna, Gabriele
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Mathematical Dynamics and Fractals #Meromorphic and Entire Functions #Statistical Mechanics (cond-mat.stat-mech)
paper · pdf · doi:10.48550/arxiv.2509.04568
openalex publication_date 2025/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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önitz 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 μSOW_\square ≤ 2.73911 and μSOW_\triangle ≤ 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 k-manifolds (SAMs) and its supersets, self-osculating k-manifolds (SOMs) in the d-dim hypercubic lattice and (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 μSASℤ3 ≤ 17.11728.