Exact Recursion Relation for 2 × N Arrays of Dumbbells

Abstract
It is shown that A(q, N), the number of ways of arranging q indistinguishable dumbbells on a 2 × N rectangular array of compartments, is exactly described by the recursion relationA(q,N)=A(q,N−1)+2A(q−1,N−1)+A(q−1,N−2)−A(q−3,N−3). For large values of N the normalization of the distribution generated by this recursion relation is found to be 0.665(3.214)N and the maximum number of arrangements occurs when the array is approximately 61% occupied.

This publication has 12 references indexed in Scilit: