arXiv · 1812.06602
Graph rules for the linked cluster expansion of the Legendre effective action
Abstract
Graph rules for the linked cluster expansion of the Legendre effective action $Γ[ϕ]$ are derived and proven in $D\geq 2$ Euclidean dimensions. A key aspect is the weight assigned to articulation vertices which is itself shown to be computable from labeled tree graphs. The hopping interaction is allowed to be long ranged and scale dependent, thereby producing an in principle exact solution of $Γ[ϕ]$'s functional renormalization group equation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rudrajit Banerjee, Max Niedermaier. 2018-12-17. Graph rules for the linked cluster expansion of the Legendre effective action. https://doi.org/10.1063/1.5031429
Cite the original work for its findings. Save a collection to share your selection of sources.