Add to ORKGchapter of the book Random Matrix Theory, Eds Akemann, Baik and Di FrancescoThe 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 the counting of "virtual" links and tangles; and the counting of "coloured" alternating links and tangles. We discuss the asymptotic behavior of the number of tangles as the number of crossings goes to infinity
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
33 pages. check out the links/tangles database at this http URLVirtual links are generalizations of ...
AbstractUsing results on the counting of planar Feynman diagrams derived in matrix models, recent re...
7 pages, 6 figures, to appear in the proceedings of the 11th International Conference on Formal Powe...
RUNHETC-99-37 Proceedings of the 1999 semester of the MSRI "Random matrices and their Applications"T...
We shall explain how knot, link and tangle enumeration problems can be expressed as matrix integrals...
proceedings European Summer School St-Petersburg 2001We study the enumeration of alternating links a...
35 pagesWe propose a transfer matrix algorithm for the enumeration of alternating link diagrams with...
24 pages. revised 08/01: numerical data updated and fits refinedWe propose a new method to enumerate...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
This is a short review of recent work on the enumeration of alternating tangles and links using meth...
revised, final version to be publishedWe present a conjecture for the power-law exponent in the asym...
We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in ...
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
33 pages. check out the links/tangles database at this http URLVirtual links are generalizations of ...
AbstractUsing results on the counting of planar Feynman diagrams derived in matrix models, recent re...
7 pages, 6 figures, to appear in the proceedings of the 11th International Conference on Formal Powe...
RUNHETC-99-37 Proceedings of the 1999 semester of the MSRI "Random matrices and their Applications"T...
We shall explain how knot, link and tangle enumeration problems can be expressed as matrix integrals...
proceedings European Summer School St-Petersburg 2001We study the enumeration of alternating links a...
35 pagesWe propose a transfer matrix algorithm for the enumeration of alternating link diagrams with...
24 pages. revised 08/01: numerical data updated and fits refinedWe propose a new method to enumerate...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
This is a short review of recent work on the enumeration of alternating tangles and links using meth...
revised, final version to be publishedWe present a conjecture for the power-law exponent in the asym...
We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in ...
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
In this dissertation, we study two areas of interest in knot theory: Random knots in the unit cube, ...
A way to study, theoretically and computationally, the number and the form of linked polygons config...