Linked Cluster Expansions Beyond Nearest Neighbor Interactions: Convergence and Graph Classes

From MaRDI portal
Publication:4211940

DOI10.1142/S0217751X97001924zbMATH Open0973.82505arXivhep-lat/9604021OpenAlexW2006429144MaRDI QIDQ4211940FDOQ4211940


Authors: Andreas Pordt, T. Reisz Edit this on Wikidata


Publication date: 15 October 1998

Published in: International Journal of Modern Physics A (Search for Journal in Brave)

Abstract: We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way that the classes of graphs to be considered are identical to those of the pure nearest neighbour interaction. The only change then concerns the computation of lattice imbedding numbers. All the complications that arise can be reduced to a generalization of the notion of free random walks, including hopping beyond nearest neighbour. Explicit expressions for combinatorical numbers of the latter are given. We show that under some general conditions the linked cluster expansion series have a non-vanishing radius of convergence.


Full work available at URL: https://arxiv.org/abs/hep-lat/9604021




Recommendations



Cites Work


Cited In (8)





This page was built for publication: Linked Cluster Expansions Beyond Nearest Neighbor Interactions: Convergence and Graph Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4211940)