Related papers: On the Counting of Colored Tangles
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…
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…
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)…
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 propose a transfer matrix algorithm for the enumeration of alternating link diagrams with external legs, giving a weight $n$ to each connected component. Considering more general tetravalent diagrams with self-intersections and…
Using matrix model techniques for the counting of planar Feynman diagrams, recent results of Sundberg and Thistlethwaite on the counting of alternating tangles and links are reproduced.
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
A table of the families of alternating knots formed by conways is presented. The Conway's function is shown with the use of linear algebra in terms of natural numbers, called conways, that represent the number of crossings along a…
In this training course report, I briefly present the one- and two-matrix models as tools for the study of conformal field theories with boundaries. In a first part, after a short historical presentation of random matrices, I present the…
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…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…
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…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are…
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number…
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…