The Combinatorics of Alternating Tangles: from theory to computerized enumeration

Details The Combinatorics of Alternating Tangles: from theory to computerized enumeration The Combinatorics of Alternating Tangles: from theory to computerized enumeration

2001-11-06

arxiv.org/abs/math-ph/0111011v1

Physics

Mathematical Physics

proceedings European Summer School St-Petersburg 2001

Scientific paper

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) knots. Using a finite renormalization scheme for an associated matrix model, we first reduce the task to that of enumerating planar tetravalent diagrams with two types of vertices (self-intersections and tangencies), where now the subtle issue of topological equivalences has been eliminated. The number of such diagrams with $p$ vertices scales as $12^p$ for $p\to\infty$. We next show how to efficiently enumerate these diagrams (in time $\sim 2.7^p$) by using a transfer matrix method. We give results for various generating functions up to 22 crossings. We then comment on their large-order asymptotic behavior.

Affiliated with

Also associated with

No associations

Rating

The Combinatorics of Alternating Tangles: from theory to computerized enumeration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Combinatorics of Alternating Tangles: from theory to computerized enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Combinatorics of Alternating Tangles: from theory to computerized enumeration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-434189