ИСТИНА |
Войти в систему Регистрация |
|
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
V.O.Manturov constructed an invariant of free links by using construction of Kuperberg’s sl(3)-invariants. This invariant is valued in linear combinations of “pictures” and allows one to nearly classify free links. In our talk we are generalizing this construction for graph-links. It means that by using only adjacent matrices of graphs we can construct invariants valued in linear combinations of “pictures”. Moreover, we obtain some minimal results and results concerning classification of free graph-links.