Acta Mathematica Vietnamica

CURRENT ISSUE


 

RECENT ISSUES

Volume 42, 2017

Volume 41, 2016

Volume 40, 2015

Volume 39, 2014

Volume 38, 2013


 

 
mod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_countermod_vvisit_counter

Print

 

 

On the Degree of the Colored Jones Polynomial
Efstratia Kalfagianni, Christine Ruey Shan Lee

 

Abstract

The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the converse; if the bounds are sharp then the diagram is semi-adequate. As a result, we use colored Jones link polynomials to extract an invariant that detects semi-adequate links and discuss some applications.
You are here: Home No. 4