Show simple item record

The ne plus ultra of tree graph inequalities

dc.contributor.authorFederbush, Paul G.en_US
dc.date.accessioned2006-09-08T21:11:07Z
dc.date.available2006-09-08T21:11:07Z
dc.date.issued1990-05en_US
dc.identifier.citationFederbush, 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.issn0377-9017en_US
dc.identifier.issn1573-0530en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/43206
dc.description.abstractWith 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.extent237159 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherPhysicsen_US
dc.subject.otherGroup Theory and Generalizationsen_US
dc.subject.otherGeometryen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherStatistical Physicsen_US
dc.subject.other82A67en_US
dc.subject.other81E10en_US
dc.titleThe ne plus ultra of tree graph inequalitiesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelPhysicsen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, 48109, Ann Arbor, MI, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/43206/1/11005_2004_Article_BF00429953.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF00429953en_US
dc.identifier.sourceLetters in Mathematical Physicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.