#### Abstract

If a knot is represented by an -strand braid, then HOMFLY polynomial in representation is a sum over characters in all representations . Coefficients in this sum are traces of products of quantum -matrices along the braid, but these matrices act in the space of intertwiners, and their size is equal to the multiplicity of in . If is the fundamental representation , then is equal to the number of paths in representation graph, which lead from the fundamental vertex to the vertex . In the basis of paths the entries of the relevant -matrices are associated with the pairs of paths and are nonvanishing only when the two paths either coincide or differ by at most one vertex, as a corollary -matrices consist of just and blocks, given by very simple explicit expressions. If cabling method is used to color the knot with the representation , then the braid has as many as strands; have a bigger size , but only paths passing through the vertex are included into the sums over paths which define the products and traces of the relevant -matrices. In the case of , this path sum formula can also be interpreted as a multiple sum over the standard Young tableaux. By now it provides the most effective way for evaluation of the colored HOMFLY polynomials, conventional or extended, for arbitrary braids.

#### 1. Introduction

Knot polynomials are currently among the central objects of interest in quantum field theory; they are exactly at the border between the known and unknown. The knot polynomials can be defined as Wilson loop averages: that is, generic gauge-invariant observables in the simplest version of the 3-dimensional Yang-Mills theory and the topological Chern-Simons model [1] with the action: and they depend on a closed contour in a three dimensional manifold , on the representation of the gauge group and on the coupling constant . Since the theory is topological, the dependence is actually only on the topological class of ; that is, the contour can be considered as a knot. For the simply connected space or the average is actually a polynomial in and , hence, the name “knot polynomial.”

The study of knot polynomials in topology goes back to [2–7], and they were put into the context of quantum field theory in the seminal works by Schwarz [8] and Witten [9], further developed in [10–13]. Since the theory is topological, there are no dynamical phenomena like confinement, instead a close relation exists to the -dimensional conformal theories [9, 14–18], very much in the spirit of AdS/CFT correspondence [19–21]. In this way the knot polynomials are related to the most difficult part of conformal field theory, to modular transformations, which through the AGT relations [22–32] are connected to the -duality between the supersymmetric Yang-Mills theories [33–44]. This makes the study of knot polynomials the next task after the structure of conformal blocks themselves more or less understood in terms of the Dotsenko-Fateev matrix models [45–55] and other similar representations [56, 57].

An additional interest is induced by existence of nontrivial deformations of the knot polynomials: to superpolynomials [58–66] and refined Chern-Simons theory [67, 68] (see also [69]), to *extended* knot polynomials [70], which puts them into the class of -function like objects, and so forth. At least naively [71, 72], they belong to the family of Hurwitz partition functions [73–76], more general than the conventional KP/Toda -functions, probably related to the generalized -functions of [77–80].

However, for any kind of generic investigation and application of knot polynomials, they should be first effectively calculated and represented in a theoretically appealing form, allowing evaluation of these polynomials for particular knots and representations. There are different competitive approaches to do this, for example, [81–84]. The goal of this letter is to summarize the results of our method [70, 85–87], which provides a complete, nice, and practically efficient solution to this problem.

#### 2. HOMFLY Polynomials via Quantum -Matrices

The method may begin with choosing the temporal gauge [88–90] in Chern-Simons theory; then the theory becomes quadratic with the ultralocal propagator . Then the original knot in 3-dimensions is substituted by a 2-dimensional knot diagram (a 4-valent oriented graph), and the Wilson average reduces to a -graded trace of the product of quantum -matrices, standing at the vertices of the graph [10–12].

It is most convenient to choose the knot diagram in the form of a closure of a braid. If the braid has strands, then the product involves different -matrices: stands at the intersection of strands and , and . For instance, for the -strand braid one has In the pattern picture , , , , and (see Figure 1).

Similarly, for arbitrary The trace here is defined with additionally inserted element so that are the quantum dimensions of the representation (the characters of the group at the special values ). In this formula the matrices are of the huge size and this expression can seem absolutely hopeless to evaluate for generic group and representation .

However, things are actually much simpler. The product can be expanded into a sum of irreducible representations, generically, with nontrivial multiplicities. The crucial observation is that act as unity in each irreducible representation, so that the matrices in (4) can be reduced to of a much smaller size, equal to just the multiplicities of in [70, 85]: Here is a normalization factor which emerges due to our choice of nonstandard normalization of -matrices and is the writhe number. The standard normalization of -matrix in the vertical framing is restored with the factor , where and the sum runs over the coordinates of the boxes in the Young diagram that corresponds to the representation . In order to restore the topological invariance, one has to change framing with a factor of which totally gives .

What is important, in formula (7) the knot and group dependencies are separated and one can consider as a function of rather than ; the parameter enters only the quantum dimensions and can be easily substituted by . Moreover, this formula actually introduces the extended HOMFLY polynomial , if are interpreted as characters, which are functions of infinitely many time-variables instead of or [70, 85]. The topological invariance is, however, lost beyond the topological locus .

To deal with this formula one needs an explicit expression for the -matrices; see [85, 91, 92]. Those papers contain many various observations about the structure of -matrices, and they were used to calculate many nontrivial knot polynomials; still a complete description is not yet found on that way, except for the fundamental representation case of , fully described in [86], and for the (anti)symmetric representation case [91–93] (some results in this latter case are also reproduced by alternative methods [94–100]).

It is therefore natural to attack the case of arbitrary with the help of the cabling approach [101] and apply the results of [86]. This is successfully done in [87, 102]; this letter is a short summary of [86, 87], purified from all the details and extensive list of examples evaluated there.

Note also that here we restrict our discussion to the knots only. The links can be dealt with similarly; however, they require some technical complications; thus, for the sake of brevity, we skip this extension (see details in [87]).

#### 3. -Matrices via Paths in the Representation Graph

Since the cabling reduces the problem from to the case of the fundamental representation, the results of [86] are directly applicable [87] and we begin from repeating them in a concise and pictorial form (see Figure 2).

Implicit in [86] is representation of the coefficients in the form of a sum over paths in the representation graph [87]. The first four levels of the representation graph of [85] are shown in Figure 2; in an obvious way it describes the multiplication of fundamental representations [1]. The multiplicity of the representation in is obviously equal to the number of directed paths in the representation graph, connecting and . More generally, is equal to the number of directed paths between and . The matrices , can be represented in the basis of paths between and and according to [86, 87] they have extremely simple form in this basis.

First of all, with each index of the matrix one associates a level in the graph. A given path is passing through exactly one vertex at level and through some two adjacent vertices and at levels and . The structure of the representation graph is such that these and are connected either by a single two-segment path (singlet) (then it is a fragment of our ) or by two such paths (doublet), the segments of our path and another path . We call the transformations a *flip *(see Figure 3).

In the former case (singlet), our path provides a diagonal element in and it is equal to either or . In the language of Young diagrams the singlet appears when the two boxes added to the diagram in order to form lie either in the same row, then we put at the diagonal of , or in the same column, then we put (see Figure 4).

In the latter case (the doublet) (see Figure 5), the two boxes are neither in the same row nor in the same column, and the two paths and form a block in . This block is described as follows. First, that of the paths and which lies to the left of the other, corresponds to the left column and to the first row of the block. Second, the Young diagrams is obtained by adding two boxes to the diagram , and the two paths correspond to doing this in two different orders, thus providing at the intermediate stage the two adjacent vertices and . The two added boxes are connected by a hook in the Young diagram, which has length (measured between the *centers* of the two boxes). Then the block is equal to
Figure 5 shows that for , , , and , the parameter .

This provides a complete and very explicit description of the matrices , , which appear under the trace in the expression for . Note that in this form these matrices depend on . This description can seem rather lengthy and tricky, but in practice it is very algorithmic, easily programmable, and very effective for practical calculations [87].

The paths from to in the representation graph are labeled by the standard Young tableaux, that is, the Young diagram with the numbers assigned to its boxes in such a way that the emerging sequences are increasing along each row and each column. The number in a given box is just the number of steps, at which the box was attached to the diagram when moving from to . The number of paths is therefore equal to the well-known number of the standard Young tableaux, where is the length of the hook in associated to the box.

Thus the central formula (7) can be considered as a multiple sum over the standard Young tableaux of , and the number of summations is equal to the number of vertices in the braid.

#### 4. Examples

To illustrate the use of these formulas, we calculate the contributions of simple diagrams to the simple HOMFLY polynomials. There is nothing new in these formulas, they are present here just to illustrate how the method works. For numerous new examples see, [87].

If one considers only in the fundamental representation , , then (20) for an -strand braid involves of the size , that is, at the level in the representation graph. To make use of (20), one needs to know the matrices .

. There are two possible and and one matrix in each case.

For there is a single path from to ; that is, ; it coincides with the segment ; thus, according to our rules the corresponding matrix .

Similarly for one gets .

Thus the generic expression (19) in this case is The coefficient at the l.h.s. takes into account the normalization factor .

*.* For there are unique paths from and the corresponding matrices are again and are equal to and , respectively.

However, for the situation is already different. There are two paths between and [21], and the left one [1] → [2] → [21] contains the segment ([1], [2]), while the second path [1] → [11] → [21] contains the segment ([1], [11]). This means that the matrix in the sector is ; it is diagonal with the entries and . The matrix is again , but it is not diagonal, because the two paths are connected exactly by the flip. Since the length of the hook in this case is , our rules imply that and the formula for the arbitrary 3-strand braid is [85] (see Figure 6)

. For all the three matrices are and equal to and , respectively.

For there are three paths. Ordered from the left to the right they are At level 2 the flip relates and and at level 3 relates and . This implies that in sector one has [85]

For the answer is similar; the three paths are now

For , there are just two paths: and they are related by the flip at level 2. This means that both and are and diagonal, while is not:

The counterpart of (10) and (12) is now obvious, but rather lengthy, so we do not write it down here.

#### 5. Cabling Method

Cabling is based on the fact that the representation appears in the product of fundamental representations, ; thus, the answer for can be extracted from the answer for by the projection: where the normalization factor is slightly corrected as compared with (7), see [87] for details. Cabling is widely used not only in the knot theory [101], but also in the theory of -matrices and integrable systems [103–106] (where it is called the fusion procedure).

Here is an -strand braid, obtained from by substituting each line (strand) by a bunch (cable) of strands so that the intersection of two strands is now a peculiar combination of original -matrices, but in the fundamental representations (see Figure 7). In other words, is the projection from the reducible representation onto . It can actually be inserted everywhere in between the matrices, but for the case of knots (not links) a single insertion is sufficient.

Now, (20) can be written explicitly and calculated with the help of Section 3, but in terms of the -strand braid and the corresponding matrices replaced with . This is a rather cumbersome expression even for the simplest knots (therefore we do not rewrite (20) in this way) but absolutely straightforward and adequate for practical computations.

Moreover, here comes a bonus of the path sum representation: *the projector ** is nearly trivial,* at least in the case of knots: one should include only the directed paths from to , which pass through the vertex , this effectively decreases the size of the matrices , from to .

*NB.* The constituent matrices , , cannot be reduced in this way: one cannot insert the projector *inside* .

#### 6. Cabling for and

Now we can use the last example in Section 4 to demonstrate how the cabling works in our formulas. The 4-strand braids are enough to describe only the 2-strand (torus) knots in representations [2] and [11]. In this case there is just a single combined matrix:

According to our rules, if we consider, for example, for a -strand knot, we should leave in only the paths passing through the vertex .

This means that the single path leading to remains intact, while the one to is now eliminated; this means that there will be no contribution of to .

From the three paths which led to , only two remain, and ; thus the third line and the third column should be omitted from the matrix : This matrix has two eigenvalues: 0 and −1.

Similarly from the three paths to only one survives, , and matrix is reduced to : Thus, despite a path survives in the [211] sector, its contribution is actually vanishing, as it should be, because .

Also for only one path of the two remains, , and

Putting everything together one gets for odd (i.e., for the knot): The formula at the last line is the standard Rosso-Jones expression [107–109] for the colored HOMFLY polynomial in the case of a torus knot.

*NB.* Note that the matrices *do not* commute with and that the projector is as simple as described above only for the first cable in the braid.

Note also that two of the five do not contribute to the middle line for somewhat different reasons; does not appear, because there are no paths, going from to [1111] via [2], while for such path exists, just its contribution to the relevant element of is zero.

These examples illustrate all the peculiarities of our formulas. Once they are understood, the use of the path sum formalism is straightforward.

#### 7. Open Questions

The path sum formula provides a complete solution for the evaluation problem of arbitrary colored HOMFLY polynomials. It is nice looking and theoretically attractive, and it is algorithmic and very effective for practical computations (a vast list of examples is provided in [87, 102]). It represents the knot polynomials in the form of a character expansion [70, 85] and therefore expresses them directly in terms of , , or, the time-variables , whatever one prefers. Still there are a few obvious directions to study.

First, our final formula for the colored knots heavily relies on the cabling approach and therefore is in a certain sense more involved than (7). In particular, when , the sizes of -matrices are considerably bigger than theoretically possible (though the entries are simpler). Of course, *the path sum representation exists for the arbitrary *, but it is in terms of another representation graph, describing powers of the representation , and the corresponding -matrices are more involved (their constituents are no longer just and blocks). At the same time that graph is the subset of the full one, , which we considered in the present letter, and the sum over the paths from to , passing through the vertex , can be also considered as a sum over just the paths from to , more in the spirit of (7). However, there are many such paths in with the same image in , and they contribute to the matrix elements of the composite . The quantities (20) contain also multiple sums over the paths from to , but in fact they do not depend on this, and one can simply fix one such path arbitrarily (as a kind of a gauge fixing). It would be very interesting to find a relevant modification of the path sum formula which would not refer to the cabling procedure, and [91, 92] strongly implies that this can be possible and that such a formula should possess its own beauties.

Second, the representation graph exists for arbitrary Lie algebras, not only for , and the sum path formula should be straightforwardly generalized to arbitrary groups, in particular, from the HOMFLY (for ) to Kauffman (for ) polynomials.

Third, it is now obvious that the Khovanov-Rozansky approach [58–63] and the superpolynomials [64, 65] should have a similar representations in terms of the multiple sums over paths (i.e., over the standard Young tableaux). There are certain advances in this direction for the torus knots [110–115], particularly close should be the results by [116, 117]. We emphasize once again that * the sums over Young tableaux provide the answers for arbitrary knots*, not only torus; this is a theorem for the HOMFLY polynomials and a plausible conjecture for the superpolynomials.

To this list one should of course add a massive calculation of the colored HOMFLY polynomials for nontorus knots, especially in representations with many lines and rows in the Young diagram, that is, not just (anti)symmetric representations. Such examples are crucially important for understanding the structure of generic knot polynomials, for example, *a la* [93–100, 102, 118, 119] or [71, 72, 120, 121] or [122], and various relations between them [123–127].

#### Acknowledgments

The authors are indebted to S. Artamonov, H. Itoyama, and A. Popolitov for fruitful discussions, which helped them to improve the presentation of the results from [86, 87] for the purposes of this paper. Thier work is partly supported by the Ministry of Education and Science of the Russian Federation under contract 8207, by the Brazil National Counsel of Scientific and Technological Development (A. Morozov), by the Dynasty Foundation (And. Morozov), by NSh-3349.2012.2, by RFBR Grants 13-02-00457 (A. Mironov), 13-02-00478 (Al. Morozov), and 12-02-31078 mol-a (A. Anokhina; And. Morozov), by joint Grant 12-02-92108-Yaf-a, 13-02-90459-Ukr-f-a, and 13-02-91371-ST-a.