The number of s-polymer coverings on an n x m lattice obeys the recurrence sum_{i=0}^{2s} (-1)^i binom(2s,i) a_{n-i,m-i} = 2^s (2s)! / s! .
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2024 2verdicts
UNVERDICTED 2representative citing papers
Recurrence relations are proved for the number of k-mer coverings on n-width m-length rectangular lattices for arbitrary k and n.
citing papers explorer
-
Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices
The number of s-polymer coverings on an n x m lattice obeys the recurrence sum_{i=0}^{2s} (-1)^i binom(2s,i) a_{n-i,m-i} = 2^s (2s)! / s! .
-
Recurrence solution of monomer-polymer models on two-dimensional rectangular lattices
Recurrence relations are proved for the number of k-mer coverings on n-width m-length rectangular lattices for arbitrary k and n.