An exact recursion for the composite nearest‐neighbor degeneracy for a 2×N lattice space
作者： R. B. McQuistan , J. L. Hock
DOI: 10.1063/1.526133
关键词: Combinatorics 、 Toeplitz systems 、 Levinson recursion 、 Mathematics 、 k-nearest neighbors algorithm 、 Identical particles 、 Theoretical physics 、 Lattice (order) 、 Composite number
摘要: 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 2×N lattice space. The associated generating functions, as well expectation of resulting statistics are also treated.
harvard.edu
scitation.org
aip.org
sci-hub.se 参考文章(5)
R. B. McQuistan, Exact Nearest Neighbor Statistics for One‐Dimensional Lattice Spaces Journal of Mathematical Physics. ,vol. 13, pp. 1317- 1319 ,(1972) , 10.1063/1.1666139
R. B. McQuistan, Exact next nearest neighbor degeneracy Journal of Mathematical Physics. ,vol. 15, pp. 1845- 1848 ,(1974) , 10.1063/1.1666549
R. B. McQuistan, Exact composite nearest neighbor degeneracies for one‐dimensional lattice spaces Journal of Mathematical Physics. ,vol. 22, pp. 1260- 1263 ,(1981) , 10.1063/1.525051
C. C. Yan, Binary mixture with nearest and next nearest neighbor interaction on a one-dimensional lattice Journal of Mathematical Physics. ,vol. 17, pp. 1684- 1687 ,(1976) , 10.1063/1.523117
Benjamin Kedem, On Nearest Neighbor Degeneracies of Indistinguishable Particles. Journal of Mathematical Physics. ,vol. 22, pp. 456- 461 ,(1980) , 10.1063/1.524930