A transfer matrix approach to the enumeration of colored links

Details A transfer matrix approach to the enumeration of colored links A transfer matrix approach to the enumeration of colored links

2001-04-05

arxiv.org/abs/math-ph/0104009v2

Physics

Mathematical Physics

35 pages

Scientific paper

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 tangencies allows us to treat topological (flype) equivalences. This is done by means of a finite renormalization scheme for an associated matrix model. We give results, expressed as polynomials in $n$, for the various generating functions up to order 19 (link diagrams), 15 (prime alternating tangles) and 11 (6-legged links) intersections. The limit $n\to\infty$ is solved explicitly. We then analyze the large-order asymptotics of the generating functions. For $0\le n \le 2$ good agreement is found with a conjecture for the critical exponent, based on the KPZ relation.

Affiliated with

Also associated with

No associations

Rating

A transfer matrix approach to the enumeration of colored links 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 A transfer matrix approach to the enumeration of colored links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A transfer matrix approach to the enumeration of colored links will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602954