Related papers: Feynman identity for planar graphs
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
We consider the infinite family of Feynman graphs known as the "banana graphs" and compute explicitly the classes of the corresponding graph hypersurfaces in the Grothendieck ring of varieties as well as their Chern-Schwartz-MacPherson…
We introduce SOFIA, a Mathematica package that automatizes the computation of singularities of Feynman integrals, based on new theoretical understanding of their analytic structure. Given a Feynman diagram, SOFIA generates a list of…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
In this paper we consider non-linear differential equations which are closely related to the generating functions of Frobenius-Euler polynomials. From our non-linear differential equations, we derive some new identities between the sums of…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…
We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing…
We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
We prove the invariance of scalar Feynman graphs of any planar topology under the Yangian level-one momentum symmetry given certain constraints on the propagator powers. The proof relies on relating this symmetry to a planarized version of…