Related papers: On knots in subdivergent diagrams

When calculating higher terms of the epsilon-expansion of massive Feynman diagrams, one needs to evaluate particular cases of multiple inverse binomial sums. These sums are related to the derivatives of certain hypergeometric functions with…

A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…

We propose a framework for calculating two-loop Feynman diagrams which appear within a renormalizable theory in the general mass case and at finite external momenta. Our approach is a combination of analytical results and of high accuracy…

We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we…

We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…

A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…

Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

This paper explores the idea that within the framework of three-dimensional quantum gravity one can extend the notion of Feynman diagram to include the coupling of the particles in the diagram with quantum gravity. The paper concentrates on…

This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…

We argue that generic one-loop scattering amplitudes in supersymmetric Yang-Mills theories can be computed equivalently with MHV diagrams or with Feynman diagrams. We first present a general proof of the covariance of one-loop non-MHV…

We give a brief survey of some known results on intrinsically linked or knotted graphs.

Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…

We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…

We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…

We summarize the Hopf algebra structure on Feynman diagrams and emphasize the interest in further algebraic structures hidden in Feynman graphs.

A detailed investigation is presented of a set of algorithms which form the basis for a fast and reliable numerical integration of one-loop multi-leg (up to six) Feynman diagrams, with special attention to the behavior around (possibly)…

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…