Related papers: Feynman Diagrams and Rooted Maps
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
The diagrammatic coaction maps any given Feynman graph into pairs of graphs and cut graphs such that, conjecturally, when these graphs are replaced by the corresponding Feynman integrals one obtains a coaction on the respective functions.…
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…
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…
The union of a directed family of topological groups can be equipped with two noteworthy topologies: the finest topology making each injection continuous, and the finest group topology making each injection continuous. This begs the…
An algorithm for obtaining the Taylor coefficients of an expansion of Feynman diagrams is proposed. It is based on recurrence relations which can be applied to the propagator as well as to the vertex diagrams. As an application, several…
Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
The many-body dynamics of interacting electrons in condensed matter and quantum chemistry is often studied at the quasiparticle level, where the perturbative diagrammatic series is partially resummed. Based on Hedin's equations for…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of…
We introduce graphcodes, a novel multi-scale summary of the topological properties of a dataset that is based on the well-established theory of persistent homology. Graphcodes handle datasets that are filtered along two real-valued scale…
In the CHY-frame for the tree-level amplitudes, the bi-adjoint scalar theory has played a fundamental role because it gives the on-shell Feynman diagrams for all other theories. Recently, an interesting generalization of the bi-adjoint…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…