Ribbon Graphs and Their Invariants Derived from Quantum Groups

Ribbon Graphs and Their Invariants Derived from Quantum Groups

1990 | N. Yu. Reshetikhin and V. G. Turaev
The paper by N. Yu. Reshetikhin and V. G. Turaev introduces a generalization of the Jones polynomial to graphs in \( R^3 \). The Jones polynomial, originally defined for links of circles in \( R^3 \), is extended to colored links and tangles using quantum \( R \)-matrices. The authors define colored ribbon graphs in \( R^2 \times [0, 1] \) and introduce Jones-type isotopy invariants for these graphs. Ribbon graphs are characterized by small plane squares ( vertices ) and thin strips ( edges ), with specific conditions for coloring vertices and edges. The coloring is based on the Drinfel'd notion of a quasitriangular Hopf algebra \( A \). For each \( A \), the authors define \( A \)-colored ribbon graphs, where edges are colored by \( A \)-modules and vertices by \( A \)-linear homomorphisms. The category of \( A \)-colored ribbon graphs is shown to be a compact braided strict monoidal category. Under certain conditions, a canonical covariant functor is constructed from the category of \( A \)-colored ribbon graphs to the category of \( A \)-modules, generalizing the Jones polynomial for links when \( A = U_q(sl_2) \). The paper also discusses the combinatorial aspects of \( A \)-modules and \( A \)-homomorphisms, particularly for 3-valent graphs. The structure of the paper includes sections on braided monoidal categories, quasitriangular and ribbon Hopf algebras, \( A \)-colored ribbon graphs, the main theorem, applications, and examples.The paper by N. Yu. Reshetikhin and V. G. Turaev introduces a generalization of the Jones polynomial to graphs in \( R^3 \). The Jones polynomial, originally defined for links of circles in \( R^3 \), is extended to colored links and tangles using quantum \( R \)-matrices. The authors define colored ribbon graphs in \( R^2 \times [0, 1] \) and introduce Jones-type isotopy invariants for these graphs. Ribbon graphs are characterized by small plane squares ( vertices ) and thin strips ( edges ), with specific conditions for coloring vertices and edges. The coloring is based on the Drinfel'd notion of a quasitriangular Hopf algebra \( A \). For each \( A \), the authors define \( A \)-colored ribbon graphs, where edges are colored by \( A \)-modules and vertices by \( A \)-linear homomorphisms. The category of \( A \)-colored ribbon graphs is shown to be a compact braided strict monoidal category. Under certain conditions, a canonical covariant functor is constructed from the category of \( A \)-colored ribbon graphs to the category of \( A \)-modules, generalizing the Jones polynomial for links when \( A = U_q(sl_2) \). The paper also discusses the combinatorial aspects of \( A \)-modules and \( A \)-homomorphisms, particularly for 3-valent graphs. The structure of the paper includes sections on braided monoidal categories, quasitriangular and ribbon Hopf algebras, \( A \)-colored ribbon graphs, the main theorem, applications, and examples.
Reach us at info@study.space