Related papers: Matrix Integrals and the Counting of Tangles and L…
The study of a certain class of matrix integrals can be motivated by their interpretation as counting objects of knot theory such as alternating prime links, tangles or knots. The simplest such model is studied in detail and allows to…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
The counting of alternating tangles in terms of their crossing number, number of external legs and connected components is presented here in a unified framework using quantum field-theoretic methods applied to a matrix model of colored…
Virtual links are generalizations of classical links that can be represented by links embedded in a ``thickened'' surface $\Sigma\times I$, product of a Riemann surface of genus $h$ with an interval. In this paper, we show that virtual…
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)…
The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
We use integrability at weak coupling to compute fishnet diagrams for four-point correlation functions in planar $\phi^4$ theory. The results are always multi-linear combinations of ladder integrals, which are in turn built out of classical…
A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams…
We propose a new method to enumerate alternating knots using a transfer matrix approach. We apply it to count numerically various objects, including prime alternating tangles with two connected components, up to order 18--22, and comment on…
We elaborate on the connection between Gel'fand-Kapranov-Zelevinsky systems, de Rham theory for twisted cohomology groups, and Pfaffian equations for Feynman integrals. We propose a novel, more efficient algorithm to compute Macaulay…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
We investigate Feynman diagrams which are calculable in terms of generalized one-loop functions, and explore how the presence or absence of transcendentals in their counterterms reflects the entanglement of link diagram constructed from…
In this paper we study how to distinguish two embeddings of a finite collection of disjoint circles into the plane up to planar isotopy. We adopt the spirit of the approach by V. Turaev, Operator Invariants of Tangles, Math. USSR-Izv. 35…
Very recently planar collections of Feynman diagrams were proposed by Borges and one of the authors as the natural generalization of Feynman diagrams for the computation of $k=3$ biadjoint amplitudes. Planar collections are one-dimensional…
Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my…
In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…
We establish a characterization of alternating links in terms of definite spanning surfaces. We apply it to obtain a new proof of Tait's conjecture that reduced alternating diagrams of the same link have the same crossing number and writhe.…
In this note we show how techniques developed for untangling planar graphs by Bose et al. [Discrete & Computational Geometry 42(4): 570-585 (2009)] and Goaoc et al. [Discrete & Com- putational Geometry 42(4): 542-569 (2009)] imply new…
We show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link…