Related papers: Enumeration of N-rooted maps using quantum field t…
We discuss the enumeration of Feynman diagrams at tree order for processes with external lines of different types. We show how this can be done by iterating algebraic Schwinger-Dyson equations. Asymptotic estimates for very many external…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
In this paper we discuss some questions about geometry over the field with one element, motivated by the properties of algebraic varieties that arise in perturbative quantum field theory. We follow the approach to F1-geometry based on…
The equivalence of the noncommutative U(N) quantum field theories related by the theta-exact Seiberg-Witten maps is in this letter proven to all orders in the perturbation theory with respect to the coupling constant. We show that this…
We report a method that exploits a connection between quantum contextuality and graph theory to reveal any form of quantum contextuality in high-precision experiments. We use this technique to identify a graph which corresponds to an…
The various sources of Rational Terms contributing to the one-loop amplitudes are critically discussed. We show that the terms originating from the generic (n-4)-dimensional structure of the numerator of the one-loop amplitude can be…
We present a formulation of quantum circuit diagrams based on the exponential map which provides a new way to calculate graphically with circuits. We present a sound list of rewrite rules for this formulation and demonstrate a variety of…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around…
In this paper we count the number of paths and cycles in complete graphs by using the number $e$. Also, we compute the number of derangements in same way. Connection by $e$ yields some nice formulas for the number of derangements, such as…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
Feynman diagrams are calculated by means of their Taylor series expansion in terms of external momenta squared. It is demonstrated in various examples that by the application of conformal mapping and Pad\'{e} approximants, it is possible to…
We review the solutions of O(N) and U(N) quantum field theories in the large $N$ limit and as 1/N expansions, in the case of vector representations. Since invariant composite fields have small fluctuations for large $N$, the method relies…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov-Witten classes, and a…
An approach to field theory is studied in which fields are comprised of $N$ constituent random neurons. Gaussian theories arise in the infinite-$N$ limit when neurons are independently distributed, via the Central Limit Theorem, while…
The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…
A sketch is given of a circle of ideas relating quantum field theories with representation theory. The main mathematical ingredients are spinor geometry and the gauge group equivariant K-theory of the space of connections.