paper

Trace-free -representations of arborescent links

arXiv:1707.03005 · doi:10.1007/s10998-018-0261-0

Abstract

Given a link , a representation is {\it trace-free} if it sends each meridian to an element with trace zero. We present a method for completely determining trace-free -representations for arborescent links. Concrete computations are done for a class of 3-bridge arborescent links.

19 pages, 8 figures; to appear on Periodica Mathematica Hungarica

References in corpus (1)