Non-perturbative graph languages, halting problem and complexity

DOI10.1515/forum-2021-0119OpenAlexW4283693960MaRDI QIDQ2171907

Yanyan Li

Publication date: 12 September 2022

Published in: Forum Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/forum-2021-0119

zbMATH Keywords

halting problemgraph languagescombinatorial Dyson-Schwinger equationscomplexity of graph grammarstopology of graphons

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Feynman diagrams (81T18) Grammars and rewriting systems (68Q42) Applications of computability and recursion theory (03D80) Infinite graphs (05C63)

Related Items (3)

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
• Combinatorial Hopf algebras from renormalization
• Anatomy of a gauge theory
• The Hopf algebra of Feynman graphs in quantum electrodynamics
• Graph grammars, insertion Lie algebras, and quantum field theory
• Introduction to graph grammars with applications to semantic networks
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• On the Hopf algebra strucutre of perturbative quantum field theories
• The master Ward identity and generalized Schwinger-Dyson equation in classical field theory
• Unique factorization in perturbative QFT
• A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence
• Circuit complexity in quantum field theory
• The analytic evolution of Dyson-Schwinger equations via homomorphism densities
• The dynamics of non-perturbative phases via Banach bundles
• The complexities of nonperturbative computations
• A measure theoretic perspective on the space of Feynman diagrams
• Renormalization of gauge fields: a Hopf algebra approach
• Renormalization and computation I: motivation and background
• Renormalisation and computation II: time cut-off and the Halting Problem
• Dyson–Schwinger equations in the theory of computation
• Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program
• Very large graphs
• Formal expressions of infinite graphs and their families
• Longitudinal and Transverse Ward–Takahashi Identities, Anomaly and Schwinger–Dyson Equation
• Graphons and renormalization of large Feynman diagrams
• Sparse exchangeable graphs and their limits via graphon processes
• Graphons, cut norm and distance, couplings and rearrangements
• Non-perturbative β-functions via Feynman graphons
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-perturbative graph languages, halting problem and complexity