Table of Contents
Fetching ...

Polaron formation as the vertex function problem: From Dyck's paths to self-energy Feynman diagrams

Tomislav Miškić, Juraj Krsnik, Stefano Ragni, Andrey S. Mishchenko, Osor S. Barišić

Abstract

We present an iterative method for generating the complete set of self-energy Feynman diagrams at arbitrary order for the single-polaron problem with arbitrary linear coupling to the lattice. The approach combines a combinatorial representation of noncrossing diagrams, based on Dyck paths associated with Stieltjes-Rogers polynomials, with the constraints of the Ward-Takahashi identity to systematically incorporate vertex corrections. This construction yields a one-to-one correspondence between terms in the expansion based on Stieltjes-Rogers polynomials and diagrammatic contributions, and provides, through a sequence of simple steps, a closed, algorithmic framework for generating all diagrams of a given order, together with their relative weights. The method enables efficient, unbiased evaluation of diagrammatic series and improves the convergence of diagrammatic Monte Carlo by eliminating the need for stochastic weighting between different topologies. We further outline how the construction can be generalized to finite-density electron systems.

Polaron formation as the vertex function problem: From Dyck's paths to self-energy Feynman diagrams

Abstract

We present an iterative method for generating the complete set of self-energy Feynman diagrams at arbitrary order for the single-polaron problem with arbitrary linear coupling to the lattice. The approach combines a combinatorial representation of noncrossing diagrams, based on Dyck paths associated with Stieltjes-Rogers polynomials, with the constraints of the Ward-Takahashi identity to systematically incorporate vertex corrections. This construction yields a one-to-one correspondence between terms in the expansion based on Stieltjes-Rogers polynomials and diagrammatic contributions, and provides, through a sequence of simple steps, a closed, algorithmic framework for generating all diagrams of a given order, together with their relative weights. The method enables efficient, unbiased evaluation of diagrammatic series and improves the convergence of diagrammatic Monte Carlo by eliminating the need for stochastic weighting between different topologies. We further outline how the construction can be generalized to finite-density electron systems.

Paper Structure

This paper contains 3 sections, 2 equations, 1 figure.

Figures (1)

  • Figure 1: