# Difference between revisions of "VasCalc - A Vassiliev Invariants Calculator"

Line 2: | Line 2: | ||

<blockquote> | <blockquote> | ||

− | Finite type (Vassiliev) invariants stand in the centre of knot theory. | + | Finite type (Vassiliev) invariants stand in the centre of knot theory. They are known to encompass very many of the invariants pivotal to knot |

− | They are known to encompass very many of the invariants pivotal to knot | + | |

theory and to low dimensional topology, and thus hundreds of papers | theory and to low dimensional topology, and thus hundreds of papers | ||

were written about them. Finite type invariants are in principle | were written about them. Finite type invariants are in principle | ||

Line 13: | Line 12: | ||

that finally our understanding of the mathematics is stable enough to | that finally our understanding of the mathematics is stable enough to | ||

justify and guide a computational effort. I propose that this work be | justify and guide a computational effort. I propose that this work be | ||

− | carried out as a joint NSERC summer research internship by '''Zavosh | + | carried out as a joint NSERC summer research internship by '''Zavosh Amir-Khosravi''' and '''Siddarth Sankaran''', where Zavosh will be writing the |

− | Amir-Khosravi''' and '''Siddarth Sankaran''', where Zavosh will be writing the | + | |

java- or C++-based "inner most loop" while Siddarth will be working on | java- or C++-based "inner most loop" while Siddarth will be working on | ||

all the surrounding logic. We will make sure that every piece of the | all the surrounding logic. We will make sure that every piece of the |

## Latest revision as of 11:22, 12 January 2009

These pages document our work on VasCalc. Let us start with the project description as appeared in our NSERC proposal:

Finite type (Vassiliev) invariants stand in the centre of knot theory. They are known to encompass very many of the invariants pivotal to knot theory and to low dimensional topology, and thus hundreds of papers were written about them. Finite type invariants are in principle algorithmic and computable, yet the computations are a complicated many-step procedure and there aren't yet coherent computer programs to carry them out.After 15 years of progress regarding finite type invariants, I feel that finally our understanding of the mathematics is stable enough to justify and guide a computational effort. I propose that this work be carried out as a joint NSERC summer research internship by

Zavosh Amir-KhosraviandSiddarth Sankaran, where Zavosh will be writing the java- or C++-based "inner most loop" while Siddarth will be working on all the surrounding logic. We will make sure that every piece of the work will be well documented and will have some "stand alone" value, so overall, I expect the project to have significant impact on the subject of finite type invariants.