Abstract
An algorithm which simplifies manipulation of higher order graphs in strong coupling is presented.
Similar content being viewed by others
References
Balian R, Drouffe J M and Itzykson C 1974Phys. Rev. D10 3376
Balian R, Drouffe J M and Itzykson C 1975Phys. Rev. D11 2104
Balian R, Drouffe J M and Itzykson C 1979Phys. Rev. D19 2514
Banks T, Susskind L and Kogut J 1976Phys. Rev. D13 1043
Bender C M, Cooper F, Guralnik G S and Sharp D H 1979Phys. Rev. D19 1865
Bender C M, Cooper F, Guralnik G S, Roskies R and Sharp D H 1981Phys. Rev. D23 2976
Bender C M, Das A and Cooper F 1983Phys. Rev. Lett. 50 397
Bender C M, Das A, Lim H and Simmons L Jr 1984Phys. Lett. B134 225
Creutz M 1984Quarks and gluons on a lattice (Cambridge: University Press)
Wilson K G 1974Phys. Rev. D10 2445
Wilson K G 1975New Phenomena in subnuclear physics (ed.) A Zichichi (New York: Plenum)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bender, C.M., Das, A. & Lim, HA. On higher order computations in strong coupling. Pramana - J Phys 23, 695–701 (1984). https://doi.org/10.1007/BF02894763
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02894763