Related papers: Planar Graphs On The World Sheet: The Hamiltonian …
A second quantized field theory on the world sheet is developed for summing planar graphs of the phi^3 theory. This is in contrast to the earlier work, which was based on first quantization. The ground state of the model is investigated…
In earlier work, using the light cone picture, a world sheet field theory that sums planar phi^3 graphs was constructed and developed. Since this theory is both non-local and not explicitly Lorentz invariant, it is desirable to have a…
Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…
This paper presents a generalization to image matching of the Hamiltonian approach for planar curve matching developed in the context of group of diffeomorphisms. We propose an efficient framework to deal with discontinuous images in any…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
We introduce an approach for imposing physically informed inductive biases in learned simulation models. We combine graph networks with a differentiable ordinary differential equation integrator as a mechanism for predicting future states,…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
We develop an approximation scheme for our worldsheet model of the sum of planar diagrams based on mean field theory. At finite coupling the mean field equations show a weak coupling solution that resembles the perturbative diagrams and a…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
It is well known that the mathematical structure underlying renormalization in perturbative quantum field theory is based on a Hopf algebra of Feynman diagrams. A precondition for this is locality of the field theory. Consequently, one…
We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for…
This work is the continuation of the earlier efforts to apply the mean field approximation to the world sheet formulation of planar phi^3 theory. The previous attempts were either simple but without solid foundation or well founded but…
A unified treatment of Schwinger parametrised Feynman amplitudes is suggested which addresses vertices of arbitrary order on the same footing as propagators. Contributions from distinct diagrams are organised collectively. The scheme is…
In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…
We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…
Recent developments in quantum chemistry, perturbative quantum field theory, statistical physics or stochastic differential equations require the introduction of new families of Feynman-type diagrams. These new families arise in various…
In this expository article we review recent advances in our understanding of the combinatorial and algebraic structure of perturbation theory in terms of Feynman graphs, and Dyson-Schwinger equations. Starting from Lie and Hopf algebras of…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…