Random walks and the colored Jones function

Simple item page
dc.creatorGaroufalidis, Stavros
dc.creatorLoebl, Martin
dc.date2002-03-01
dc.date.accessioned2026-07-07T04:46:47Z
dc.date.available2026-07-07T04:46:47Z
dc.descriptionIt 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.
dc.descriptionAMS-LaTeX, 13 pages with 12 figures
dc.identifierhttps://arxiv.org/abs/math/0203012
dc.identifierhttp://arxiv.org/abs/math/0203012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63472
dc.subjectGeometric Topology
dc.subjectQuantum Algebra
dc.titleRandom walks and the colored Jones function
dc.typetext

Files

Collections

arXiv