Counting Feynman diagrams via many-body relations

Fabian B. Kugler
Phys. Rev. E 98, 023303 – Published 7 August 2018

Abstract

We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction. Further, we apply it to different parquet-type approximations and consider spin-resolved diagrams in the Hubbard model. Low-order results and asymptotics are explicitly discussed for various vertex functions and different two-particle channels. The algorithm can easily be implemented and generalized to many-body relations of different forms and levels of approximation.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 13 May 2018

DOI:https://doi.org/10.1103/PhysRevE.98.023303

©2018 American Physical Society

Physics Subject Headings (PhySH)

Condensed Matter, Materials & Applied PhysicsStatistical Physics & ThermodynamicsParticles & FieldsGeneral Physics

Authors & Affiliations

Fabian B. Kugler

  • Physics Department, Arnold Sommerfeld Center for Theoretical Physics, and Center for NanoScience, Ludwig-Maximilians-Universität München, Theresienstr. 37, 80333 Munich, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 98, Iss. 2 — August 2018

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×