A NEW COMBINATORIC ESTIMATE FOR CLUSTER EXPANSIONS

abstract

• We state and prove a new and previously unsuspected tree graph inequality, which is significantly stronger than the one commonly applied to cluster expansions. The older inequality controls the counting problem in the convergence proof of such an expansion, but the new inequality does more: it also exhibits extra 1/n! factors that can be applied to the cancellation of number divergences. The proof of this new combinatoric estimate is completely elementary. 1984 Springer-Verlag.

authors

• Battle, Guy

published proceedings

• COMMUNICATIONS IN MATHEMATICAL PHYSICS

author list (cited authors)

• BATTLE, G. A.

citation count

• 17

complete list of authors

• BATTLE, GA

publication date

• March 1984

publisher

• Springer Nature  Publisher

published in

• Communications in Mathematical Physics  Journal

keywords

• 10 Reduced Inequalities
• 49 Mathematical Sciences
• 4901 Applied Mathematics
• 4904 Pure Mathematics

Digital Object Identifier (DOI)

• 10.1007/BF01212353

start page

• 133

end page

• 139

volume

• 94

issue

• 1

URL

• http://dx.doi.org/10.1007/bf01212353

user-defined tag

• 10 Reduced Inequalities