1978
DOI: 10.1063/1.523586
|View full text |Cite
|
Sign up to set email alerts
|

A new form of the Mayer expansion in classical statistical mechanics

Abstract: New expressions are given for the expansion coefficients in the Mayer expansion (and thus the virial expansion). These promise to be useful in applications, as well as provide a simple rigorous proof of the convergence of the Mayer series and some of its properties.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0
1

Year Published

1982
1982
2007
2007

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 98 publications
(99 citation statements)
references
References 3 publications
0
98
0
1
Order By: Relevance
“…Now we return to the proof of Lemma 3.1. Since 21) then taking into account dependence of b m and δ m on m (see (2.10)) and definition (3.21), we obtain by summing over trees η the estimate:…”
Section: Proposition 42 Letmentioning
confidence: 99%
See 1 more Smart Citation
“…Now we return to the proof of Lemma 3.1. Since 21) then taking into account dependence of b m and δ m on m (see (2.10)) and definition (3.21), we obtain by summing over trees η the estimate:…”
Section: Proposition 42 Letmentioning
confidence: 99%
“…By construction (3.9)-(3.10) the function G Λ,Xn 0 (t k , t k ′ ; (s) n−1 , 0) is a convex combination of "diagonalized" covariances (see [21], or [30,Sec.18.2]):…”
Section: Proposition 42 Letmentioning
confidence: 99%
“…, γ n )|, since the pair potential is not purely hard-core (and also not purely repulsive). We will rather make use of another well known "tree graph identity" originally proved in [3] (see also [4,1,17,16]). …”
Section: Proof Of Theoremmentioning
confidence: 99%
“…We state the so called tree graph identity [3], [1], [4] by using the notations of [17] and [16]. We use the short notation I n = {1, 2, .…”
Section: Tree Graph Inequality For |φmentioning
confidence: 99%
See 1 more Smart Citation