The ne plus ultra of tree graph inequalities
dc.contributor.author | Federbush, Paul G. | en_US |
dc.date.accessioned | 2006-09-08T21:11:07Z | |
dc.date.available | 2006-09-08T21:11:07Z | |
dc.date.issued | 1990-05 | en_US |
dc.identifier.citation | Federbush, Paul; (1990). "The ne plus ultra of tree graph inequalities." Letters in Mathematical Physics 19(4): 337-341. <http://hdl.handle.net/2027.42/43206> | en_US |
dc.identifier.issn | 0377-9017 | en_US |
dc.identifier.issn | 1573-0530 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/43206 | |
dc.description.abstract | With nary mention of a tree graph, we obtain a cluster expansion bound that includes and vastly generalizes bounds as obtained by extant tree graph inequalities. This includes applications to both two-body and many-body potential situations of the recently obtained ‘new improved tree graph inequalities’ that have led to the ‘extra 1/ N ! factors’. We work in a formalism coupling a discrete set of boson variables, such as occurs in a lattice system in classical statistical mechanics, or in Euclidean quantum field theory. The estimates of this Letter apply to numerical factors as arising in cluster expansions, due to essentially arbitrary sequences of the basic operations: interpolation of the covariance, interpolation of the interaction, and integration by parts. This includes complicated evolutions, such as the repeated use of interpolation to decouple the same variables several times, to ensure higher connectivity for renormalization purposes, in quantum field theory. | en_US |
dc.format.extent | 237159 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Physics | en_US |
dc.subject.other | Group Theory and Generalizations | en_US |
dc.subject.other | Geometry | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Statistical Physics | en_US |
dc.subject.other | 82A67 | en_US |
dc.subject.other | 81E10 | en_US |
dc.title | The ne plus ultra of tree graph inequalities | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Physics | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/43206/1/11005_2004_Article_BF00429953.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF00429953 | en_US |
dc.identifier.source | Letters in Mathematical Physics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.