| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
27 April 2024 |
|
| | | |
|
Article overview
| |
|
Linked cluster expansions beyond nearest neighbour interactions: convergence and graph classes | A. Pordt
; T. Reisz
; | Date: |
24 Apr 1996 | Journal: | Int.J.Mod.Phys. A12 (1997) 3739-3758 | Subject: | hep-lat | 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. | Source: | arXiv, hep-lat/9604021 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |