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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.