arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0203012math.GTmath.QA

Random walks and the colored Jones function

Stavros Garoufalidis, Martin Loebl

英文摘要:

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑