Related papers: Supermanifolds from Feynman graphs

We study the dual graph polynomials and the case when a Feynman graph has no triangles but has a 4-face. This leads to the proof of the duality-admissibility of all graphs up to 18 loops. As a consequence, the $c_2$ invariant is the same…

A log symplectic manifold is a Poisson manifold which is generically nondegenerate. We develop two methods for constructing the symplectic groupoids of log symplectic manifolds. The first is a blow-up construction, corresponding to the…

We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…

In this paper we compute extension groups in the category of strict polynomial superfunctors and thereby exhibit certain "universal extension classes" for the general linear supergroup. Some of these classes restrict to the universal…

We generalize the concept of Fermi normal coordinates adapted to a geodesic to the case where the tangent space to the manifold at the base point is decomposed into a direct product of an arbitrary number of subspaces, so that we follow…

We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a…

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

We study the Riemannian geometry of the Deep Linear Network (DLN) as a foundation for a thermodynamic description of the learning process. The main tools are the use of group actions to analyze overparametrization and the use of Riemannian…

This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…

A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…

It is known that every irreducible unitary representation of positive energy of the Poincar\'e group can be realized as a subspace of tensor fields on Minkowski spacetime subjected to suitable partial differential equations. We first…

Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…

It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

We recall the notion of (vertical) translating solitons in a product of a semi-Riemannian manifold $(M,g)$ and the real line. Mainly, we restrict our attention to those which are the graph of a smooth function. When dealing with…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. We propose the systematic use of symmetric spaces in representation learning,…

In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…

We investigate the Berezin integral of non-compactly supported quantities. In the framework of supermanifolds with corners, we give a general, explicit and coordinate-free repesentation of the boundary terms introduced by an arbitrary…

We introduce an efficient configuration space technique which allows one to compute a class of Feynman diagrams which generalize the scalar sunset topology to any number of massive internal lines. General tensor vertex structures and…