Related papers: Graph Reconstruction, Functorial Feynman Rules and…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
Motivated by some computations of Feynman integrals and certain conjectures on mixed Tate motives, Bejleri and Marcolli posed questions about the $\mathbb{F}_1$-structure (in the sense of torification) on the complement of a hyperplane…
We give a presentation of Feynman categories from a representation--theoretical viewpoint. Feynman categories are a special type of monoidal categories and their representations are monoidal functors. They can be viewed as a far reaching…
We study for subgroups $G\subseteq U(N)$ partial summations of the $\theta$-expanded perturbation theory. On diagrammatic level a summation procedure is established, which in the U(N) case delivers the full star-product induced rules.…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…
Diagrammatic approaches to perturbation theory transformed the practicability of calculations in particle physics. In the case of extended theories of gravity, however, obtaining the relevant diagrammatic rules is non-trivial: we must…
Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from…
Despite recent advances in representation learning in hypercomplex (HC) space, this subject is still vastly unexplored in the context of graphs. Motivated by the complex and quaternion algebras, which have been found in several contexts to…
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The BKMP Remodeling Conjecture \cite{Ma,BKMP09,BKMP10} predicts all genus open-closed Gromov-Witten invariants for a toric Calabi-Yau $3$-orbifold by Eynard-Orantin's topological recursion \cite{EO07} on its mirror curve. The proof of the…
To understand cognitive reasoning in the brain, it has been proposed that symbols and compositions of symbols are represented by activity patterns (vectors) in a large population of neurons. Formal models implementing this idea [Plate…
We study an issue commonly seen with graph data analysis: many real-world complex systems involving high-order interactions are best encoded by hypergraphs; however, their datasets often end up being published or studied only in the form of…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
In order to use the Gaussian representation for propagators in Feynman amplitudes, a representation which is useful to relate string theory and field theory, one has to prove first that each $\alpha$- parameter (where $\alpha$ is the…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
We study the related questions: (i) when Feynman amplitudes in massless $\phi^4$ theory evaluate to multiple zeta values, and (ii) when their underlying motives are mixed Tate. More generally, by considering configurations of singular…
We introduce a class of rooted graphs which allows one to encode various kinds of classical or quantum circuits. We then follow a set-theoretic approach to define rewrite systems over the considered graphs and propose a new complete…