l Finite type invariants and n-equivalence of graphs
Speaker
l Jeong Myeongju (Korea Science Academy)
Date
l 2009-08-21
Link
l
DownLoad
l
Etc
l 2009 Combinatorics Workshop
Gussarov introduced n-equivalence of knots and showed that any pair of n-equivalent knots
have the same value for all finite type invariants of degree less than n. Since we may get many
finite type invariants from quantum invariants of knots, quantum invariants are used to verify
whether
Videos
Home > Activities > Outputs > Videos
Title 
