—HŠw•”ƒgƒ|ƒƒW[ƒZƒ~ƒi[@

Degree Sequence for Non-Compact Knots

Rama Mishra ށ iIndian Institute of Technologyj

‚P‚QŒŽ‚Q‚Q“ϊiŒŽj@16:00 ~ 17:30

‘ˆξ“c‘εŠw—HŠw•”i‘ε‹v•ΫƒLƒƒƒ“ƒpƒXj‚T‚T†ŠΩN“‚PŠK ‘ζ‚P‰ο‹cŽΊ

ŠT—vFVassiliev introduced the notion of non-compact knots (embedding of R in R3) for computing new invariants. It was observed that any non-compact knot is equivalent to a Polynomial embeddings. Thus, given a Knot-type finding out three polynomials f(t), g(t) and h(t) such that the map t --> (f(t), g(t), h(t)) can represent it will be a useful proposition. If deg f(t) =l, deg g(t) = m and deg h(t) = n we way that (l, m, n) is a degree sequence for the given Knot-type. If (l, m, n) is minimal with this property then we say that it is the minimal degree sequence. We will discuss the issue of finding out a degree wequence and the minimal degree sequence for given Knot-types.


’˜blF@‘Ίγ@‡@i‘ˆξ“c‘εŠw—HŠw•””—‰ΘŠw‰Θj

e-mail: murakami@waseda.jp