The complexities of nonperturbative computations

DOI10.1134/S1061920821030092zbMath1499.81076OpenAlexW3199526933MaRDI QIDQ2239363

Ali Shojaei-Fard

Publication date: 3 November 2021

Published in: Russian Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1061920821030092

Mathematics Subject Classification ID

Model quantum field theories (81T10) Nonperturbative methods of renormalization applied to problems in quantum field theory (81T16) Renormalization group methods applied to problems in quantum field theory (81T17)

Related Items (4)

Non-perturbative graph languages, halting problem and complexity ⋮ A statistical mechanical model for non-perturbative regimes ⋮ Graph polynomials associated with Dyson-Schwinger equations ⋮ From Dyson-Schwinger equations to quantum entanglement

Cites Work

• Mathematical aspects of quantum field theories. Contributions of the Les Houches winter school `Mathematical aspects of field theories', Les Houches, France, January and February 2012
• Anatomy of a gauge theory
• Classification of systems of Dyson-Schwinger equations in the Hopf algebra of decorated rooted trees.
• Renormalization automated by Hopf algebra
• A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence
• From classical field theory to perturbative quantum field theory
• A measure theoretic perspective on the space of Feynman diagrams
• Convergence of Bogoliubov's method of renormalization in momentum space
• Lectures on non-perturbative effects in large N gauge theories, matrix models and strings
• A Combinatorial Perspective on Quantum Field Theory
• Invariance and Universality of Complexity
• Renormalisation and computation II: time cut-off and the Halting Problem
• Towards a Definition of an Algorithm
• Dyson–Schwinger equations in the theory of computation
• Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program
• New Algebraic Aspects of Perturbative and Non-perturbative Quantum Field Theory
• Feynman integrals and multiple polylogarithms
• Metrics for sparse graphs
• Graphons and renormalization of large Feynman diagrams
• Sparse exchangeable graphs and their limits via graphon processes
• Graphons, cut norm and distance, couplings and rearrangements
• Computational Complexity
• Non-perturbative β-functions via Feynman graphons
• A GEOMETRIC PERSPECTIVE ON COUNTERTERMS RELATED TO DYSON–SCHWINGER EQUATIONS
• Formal aspects of non-perturbative Quantum Field Theory via an operator theoretic setting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexities of nonperturbative computations