Polaron formation as the vertex function problem: From Dyck's paths to self-energy Feynman diagrams (2505.21054v1)
Abstract: We present a novel iterative method for generating all self-energy Feynman diagrams of any given order for the single polaron problem. This approach offers an effective tool for circumventing the sign problem that often arises in approximation-free numerical summations of Feynman diagrams. Each iterative step begins by rigorously listing all noncrossing diagrams using the graphical Dyck path representation of Stieltjes-Rogers polynomials, which exactly encode the Feynman diagram series. In the second phase, the Ward-Takahashi identity is used to uniquely identify the complete subset of vertex function contributions from the self-energy diagrams obtained in the previous iterative step. Finally, the noncrossing diagrams and vertex function contributions are combined to construct the full set of Feynman diagrams at a given order of the diagrammatic expansion, determining the number of diagrams of various types. This approach establishes a systematic procedure for generating the total sum of diagrams in a given order, enabling significant sign cancellation and making it broadly suitable for numerical summation techniques involving Feynman diagrams.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.