An exact recursion for the composite nearest-neighbor degeneracy for a 2×N lattice space

Abstract

A set theoretic argument is utilized to develop a recursion relation that yields exactly the composite nearest‐neighbor degeneracy for simple, indistinguishable particles distributed on a 2×N lattice space. The associated generating functions, as well as the expectation of the resulting statistics are also treated.