SIMPLIFIED NUMERICAL FORM OF UNIVERSAL FINITE TYPE INVARIANT OF GAUSS WORDS
2013 ◽
Vol 22
(08)
◽
pp. 1350037
Keyword(s):
In this paper, we study the finite type invariants of Gauss words. In the Polyak algebra techniques, we reduce the determination of the group structure to transformation of a matrix into its Smith normal form and we give the simplified form of a universal finite type invariant by means of the isomorphism of this transformation. The advantage of this process is that we can implement it as a computer program. We obtain the universal finite type invariant of degrees 4, 5 and 6 explicitly. Moreover, as an application, we give the complete classification of Gauss words of rank 4 and the partial classification of Gauss words of rank 5 where the distinction of only one pair remains.
1977 ◽
Vol 286
(1336)
◽
pp. 235-237
Keyword(s):
2013 ◽
Vol 22
(08)
◽
pp. 1350042
◽
2004 ◽
Vol 13
(01)
◽
pp. 1-11
2013 ◽
Vol 22
(13)
◽
pp. 1350074
Keyword(s):
2001 ◽
Vol 10
(02)
◽
pp. 309-329
2006 ◽
Vol 15
(09)
◽
pp. 1163-1199
◽
2007 ◽
Vol 142
(3)
◽
pp. 459-468
◽
2008 ◽
Vol 19
(06)
◽
pp. 747-766
◽
Keyword(s):
2000 ◽
Vol 09
(06)
◽
pp. 735-758
◽
Keyword(s):