We present ways of counting configurations of uni-trivalent Feynman graphs in 3-manifolds in order to produce invariants of these 3-manifolds and of their links, following Gauss, Witten, Bar-Natan, Kontsevich and others. We first review the construction of the simplest invariants that can be obtained in our setting. These invariants are the linking number and the Casson invariant of integer homology 3-spheres. Next we see how the involved ingredients, which may be explicitly described using gradient flows of Morse functions, allow us to define a functor on the category of framed tangles in rational homology cylinders. Finally, we describe some properties of our functor, which generalizes both a universal Vassiliev invariant for links in the...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...
Given an special type of triangulation T for an oriented closed 3-manifold M3 we produce a framed li...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...
We present ways of counting configurations of uni-trivalent Feynman graphs in 3-manifolds in order t...
502 pages, Second version of 555 pages, with more introductory parts, more figures, a reorganizati...
68 pages. Change of title, updates and minor reorganization of notes of five lectures presented in t...
The goal of this thesis is to describe certain algebraic invariants of links, and try to modify them...
Any topological theory of knots and links should be based on simple ideas of intersection and linkin...
We introduce a homology surgery problem in dimension 3 which has the prop-erty that the vanishing of...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
In this thesis, we develop algorithms in computational topology for working with regular CW-complexe...
Combings of oriented compact 3-manifolds are homotopy classes of nowhere zero vector fields in these...
Abstract. In this paper we construct invariants of 3-manifolds “a ̀ la Reshetikhin-Turaev ” in the s...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...
Given an special type of triangulation T for an oriented closed 3-manifold M3 we produce a framed li...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...
We present ways of counting configurations of uni-trivalent Feynman graphs in 3-manifolds in order t...
502 pages, Second version of 555 pages, with more introductory parts, more figures, a reorganizati...
68 pages. Change of title, updates and minor reorganization of notes of five lectures presented in t...
The goal of this thesis is to describe certain algebraic invariants of links, and try to modify them...
Any topological theory of knots and links should be based on simple ideas of intersection and linkin...
We introduce a homology surgery problem in dimension 3 which has the prop-erty that the vanishing of...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
42 pages, 42 figuresIn this paper we construct invariants of 3-manifolds "á la Reshetikhin-Turaev" i...
In this thesis, we develop algorithms in computational topology for working with regular CW-complexe...
Combings of oriented compact 3-manifolds are homotopy classes of nowhere zero vector fields in these...
Abstract. In this paper we construct invariants of 3-manifolds “a ̀ la Reshetikhin-Turaev ” in the s...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...
Given an special type of triangulation T for an oriented closed 3-manifold M3 we produce a framed li...
We describe a simple algorithm to obtain a catalogue of 3-bridge links by computer, depending upon 6...