Combinatorial Formulae for Finite-Type Invariants via Parities

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36 pages, v2--Minor changes to exposition; added Theorem 12; Corrected typo in table on page 34

Scientific paper

The celebrated theorem of Goussarov states that all finite-type (Vassiliev-Goussarov) invariants of classical knots can be expressed in terms of Polyak-Viro combinatorial formulae. These formulae intrinsically use non-realizable Gauss diagrams and virtual knots. Some of these formulae can be naturally extended to virtual knots; however, the class of finite-type invariants of virtual knots obtained by using these formulae (so-called Goussarov-Polyak-Viro finite-type invariants) is very small. Kauffman gave a more natural notion of finite-type invariants, which, however, turned out to be quite complicated: even invariants of order zero form an infinite-dimensional space. Recently, the second named author introduced the notion of {\em parity} which turned out to be extremely useful for many purposes in virtual knot theory and low-dimensional topology; in particular, they turned out to be useful for constructing invariants of {\em free knots}, the latter being very close to the notion of order 0 invariants. In the present paper we use the concept of parity to enlarge the notion of Goussarov-Polyak-Viro combinatorial formulae and provide explicit formulae for these invariants. Not all of the new invariants are of GPV finite-type, but they all are of Kauffman finite-type. Also, we establish some relations with the with the standard GPV formulae.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Combinatorial Formulae for Finite-Type Invariants via Parities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Formulae for Finite-Type Invariants via Parities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Formulae for Finite-Type Invariants via Parities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-706960

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.