Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chebyshev polynomials and the Frohman-Gelca formula

Published 14 Mar 2014 in math.GT | (1403.3716v1)

Abstract: Using Chebyshev polynomials, C. Frohman and R. Gelca introduce a basis of the Kauffman bracket skein module of the torus. This basis is especially useful because the Jones-Kauffman product can be described via a very simple Product-to-Sum formula. Presented in this work is a diagrammatic proof of this formula, which emphasizes and demystifies the role played by Chebyshev polynomials.

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.