Related papers: Feynman identity for planar graphs

We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…

We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…

We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…

We present significant evidence that the powerful property of Yangian invariance extends to a new large class of conformally invariant Feynman integrals. Our results apply to planar Feynman diagrams in any spacetime dimension dual to an…

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

In this paper, we establish the convergence of Feynman graph integrals on closed real-analytic K\"ahler manifolds and uncover the structural mechanism underlying this convergence. The key insight is that, using Getzler's rescaling…

Results are presented for some 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. The sums of these series can be evaluated…

Motivated by some computations of Feynman integrals and certain conjectures on mixed Tate motives, Bejleri and Marcolli posed questions about the $\mathbb{F}_1$-structure (in the sense of torification) on the complement of a hyperplane…

A recent construction of polylogarithms on Riemann surfaces of arbitrary genus in arXiv:2306.08644 is based on a flat connection assembled from single-valued non-holomorphic integration kernels that depend on two points on the Riemann…

We study the Feynman integral for the three-banana graph defined as the scalar two-point self-energy at three-loop order. The Feynman integral is evaluated for all identical internal masses in two space-time dimensions. Two calculations are…

We give a brief introduction to a parametric approach for the derivation of shift relations between Feynman integrals and a result on the number of master integrals. The shift relations are obtained from parametric annihilators of the…

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…

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…

One of the most famous problems in mathematics is the Riemann hypothesis: that the non-trivial zeros of the Riemann zeta function lie on a line in the complex plane. One way to prove the hypothesis would be to identify the zeros as…

Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…