Papers
Topics
Authors
Recent
Search
2000 character limit reached

Trace-free ${\rm SL}(2,\mathbb{C})$-representations of arborescent links

Published 10 Jul 2017 in math.GT | (1707.03005v3)

Abstract: Given a link $L\subset S3$, a representation $\pi_1(S3-L)\to{\rm SL}(2,\mathbb{C})$ is {\it trace-free} if it sends each meridian to an element with trace zero. We present a method for completely determining trace-free ${\rm SL}(2,\mathbb{C})$-representations for arborescent links. Concrete computations are done for a class of 3-bridge arborescent links.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.