A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence

DOI10.1007/s40509-016-0088-4zbMath1400.68071OpenAlexW2530708956MaRDI QIDQ1621258

Ali Shojaei-Fard

Publication date: 8 November 2018

Published in: Quantum Studies: Mathematics and Foundations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40509-016-0088-4

zbMATH Keywords

Galois groupsPicard-Fuchs equationsRiemann-Hilbert correspondencetheory of computationhalting problemDyson-Schwinger equationsHall setsintermediate algorithmsrenormalization Hopf algebra

Mathematics Subject Classification ID

Related Items (6)

Graphons and renormalization of large Feynman diagrams ⋮ Non-perturbative graph languages, halting problem and complexity ⋮ From Dyson-Schwinger equations to quantum entanglement ⋮ Non-perturbative β-functions via Feynman graphons ⋮ The dynamics of non-perturbative phases via Banach bundles ⋮ The complexities of nonperturbative computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Angles, scales and parametric renormalization
• Singularities of differentiable maps, Volume 2. Monodromy and asymptotics of integrals. Transl. from the Russian by Hugh Porteous and revised by the authors and James Montaldi
• Combinatorics of renormalization as matrix calculus
• Lie algebras associated to systems of Dyson-Schwinger equations.
• Anatomy of a gauge theory
• On motives associated to graph polynomials
• Classification of systems of Dyson-Schwinger equations in the Hopf algebra of decorated rooted trees.
• Motives associated to graphs
• On the Hopf algebra strucutre of perturbative quantum field theories
• Unique factorization in perturbative QFT
• New mathematical structures in renormalizable quantum field theories
• Renormalization in quantum field theory and the Riemann-Hilbert problem. I: The Hopf algebra structure of graphs and the main theorem
• Galois theory and algorithms for linear differential equations
• Faà di Bruno subalgebras of the Hopf algebra of planar trees from combinatorial Dyson-Schwinger equations.
• Most programs stop quickly or never halt
• Renormalization and computation I: motivation and background
• MOTIVIC DYSON–SCHWINGER EQUATIONS
• THE GLOBAL β-FUNCTIONS FROM SOLUTIONS OF DYSON–SCHWINGER EQUATIONS
• Renormalisation and computation II: time cut-off and the Halting Problem
• Feynman motives and deletion-contraction relations
• Physics, Topology, Logic and Computation: A Rosetta Stone
• Towards a Definition of an Algorithm
• Dyson–Schwinger equations in the theory of computation
• Renormalization, the Riemann–Hilbert Correspondence, and Motivic Galois Theory
• Factorization in Quantum Field Theory: An Exercise in Hopf Algebras and Local Singularities
• Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program
• FROM DYSON–SCHWINGER EQUATIONS TO THE RIEMANN–HILBERT CORRESPONDENCE
• A Course in Mathematical Logic for Mathematicians
• New Algebraic Aspects of Perturbative and Non-perturbative Quantum Field Theory
• A Contribution to the Theory of Groups of Prime-Power Order
• ALGEBRO-GEOMETRIC FEYNMAN RULES
• A GEOMETRIC PERSPECTIVE ON COUNTERTERMS RELATED TO DYSON–SCHWINGER EQUATIONS
• Counterterms in the context of the universal Hopf algebra of renormalization
• On a Factorisation of Free Monoids
• Über Beziehungen zwischen höheren Kommutatoren.
• A Basis for Free Lie Rings and Higher Commutators in Free Groups
• Renormalization in quantum field theory and the Riemann-Hilbert problem. II: The \(\beta\)-function, diffeomorphisms and the renormalization group.

This page was built for publication: A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence