Related papers: Feynman identity for planar graphs
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…
Feynman diagrams are a pictorial way of describing integrals predicting possible outcomes of interactions of subatomic particles in the context of quantum field physics. It is highly desirable to have an intrinsic mathematical…
We present results for infinite series appearing in Feynman diagram calculations, many of which are similar to the Euler series. These include both one-, two- and three-dimensional series. All these series can be expressed in terms of…
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
We show how the Fibonacci's identity is used to obtain Euler bricks. Also,we put forward the relation between Fibonacci's identity and Euler's formula, which provides the description of Euler's bricks with noninteger spatial diagonal.…
We present STR (Star-Triangle Relations), a Mathematica package designed to solve Feynman diagrams by means of the method of uniqueness in any Euclidean spacetime dimension. The method of uniqueness is a powerful technique to solve…
The characteristic sequence of hypergraphs $<P_n : n<\omega>$ associated to a formula $\phi(x;y)$, introduced in [arXiv:0908.4111], is defined by $P_n(y_1,... y_n) = (\exists x) \bigwedge_{i\leq n} \phi(x;y_i)$. This paper continues the…
We investigate the computational complexity of the graph primality testing problem with respect to the direct product (also known as Kronecker, cardinal or tensor product). In [1] Imrich proves that both primality testing and a unique prime…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
For every integer $g$, isomorphism of graphs of Euler genus at most $g$ can be decided in linear time. This improves previously known algorithms whose time complexity is $n^{O(g)}$ (shown in early 1980's), and in fact, this is the first…
We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…
We present results for some infinite series appearing in Feynman diagram calculations, many of which are similar to the Euler series. These include both one-dimensional and two-dimensional series. Most of these series can be expressed in…
The amplitude of subdivergence-free logarithmically divergent Feynman graphs in $\phi^4$-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs,…
Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
We study the most general triangle diagram through the Symmetries of Feynman Integrals (SFI) approach. The SFI equation system is obtained and presented in a simple basis. The system is solved providing a novel derivation of an essentially…
Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly $j$ different multiples of $r$, for a…
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…