Related papers: Enumeration of N-rooted maps using quantum field t…
A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along…
We consider K-theoretic Gromov-Witten theory of root constructions. We calculate some genus $0$ K-theoretic Gromov-Witten invariants of a root gerbe. We also obtain a K-theoretic relative/orbifold correspondence in genus $0$.
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…
We propose a quantum field theory (QFT) method to approach the classification of indefinite sector of Kac-Moody algebras. In this approach, Vinberg relations are interpreted as the discrete version of the QFT_{2} equation of motion of a…
A detailed investigation is presented of a set of algorithms which form the basis for a fast and reliable numerical integration of one-loop multi-leg (up to six) Feynman diagrams, with special attention to the behavior around (possibly)…
This is a historical note. In 1979 we wrote a paper in a Russian Journal called Vestnik Leingradskogo Gosudarstvennogo Universiteta. We considered massive scalar quantum filed theory. One loop Feynman diagrams were evaluated. Theorem was…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of…
We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We postulate that this study can be viewed as a linear algebraic analogue of the classical topic of enumerating…
Work is reported on finite integral representations for 2-loop massive 2-, 3- and 4-point functions, using orthogonal and parallel space variables. It is shown that this can be utilized to cover particles with arbitrary spin (tensor…
Loop-tree duality allows to express virtual contributions in terms of phase-space integrals, thus leading to a direct comparison with real radiation terms. In this talk, we review the basis of the method and describe its application to…
In this paper we discuss the relation between the standard covariant quantum field theory and light-front field theory. We define covariant theory by its Feynman diagrams, whereas light-front field theory is defined in terms of light-cone…
A scalar field obeying a Lorentz invariant higher order wave equation, is minimally coupled to the electromagnetic field. The propagator and vertex factors for the Feynman diagrams, are determined. As an example we write down the matrix…
The quantum gravity path integral involves a sum over topologies that invites comparisons to worldsheet string theory and to Feynman diagrams of quantum field theory. However, the latter are naturally associated with the non-abelian algebra…
We rewrite the loop equations of the hermitian matrix model, in a way which allows to compute all the correlation functions, to all orders in the topological $1/N^2$ expansion, as residues on an hyperelliptical curve. Those residues, can be…
Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. Therefore, to execute an arbitrary quantum circuit on the hardware, compilers have to first perform the task of qubit routing,…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…