ÂÅÐÑÈß ÄËß ÑËÀÁÎÂÈÄßÙÈÕ
Enter
Login:
Password:
Forgot your password?
scientific activity
structureeducational projectsperiodicalsstaffpress centercontacts
ðóññêèé | english

Discrete and Computational Geometry

October 7 (Tuesday), 1300, IITP RAS, room 307

Sergey Lando

On the signed number of circuits of even length in nonoriented graphs
A chord diagram is a one-face map. To a chord diagram, a simple graph can be associated, which is the intersection graph of the diagram. The chord diagram structure allows one to assign signs to circuits of even length in this graph in a natural way. The difference between the number of positive and negative circuits of given length 2k is a graph invariant. This invariant is closely related to the weight system (in other words, to the Vassiliev knot invariants) associated to the Lie algebra sl2. It happens that this invariant admits a natural extension to arbitrary graphs, including those that are not intersection graphs of chord diagrams. This fact leads to a number of questions concerning the existence of more graph invariants related to sl2 and other Lie algebras. 
The talk is based on a joint paper with E. Kulakova, T. Mukhutdinova and G. Rybnikov (2014).
06.10.2014 |
 

 

© Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 2024
About  |  Contacts  |  Ïðîòèâîäåéñòâèå êîððóïöèè