Abstract. In this article we give necessary and sufficient conditions for two triples of integers to be realized as the Thurston-Bennequin number and the rotation number of a Legendrian θ−graph with all cycles unknotted. We show that these invariants are not enough to determine the Legendrian class of a topologically planar θ−graph. We define the transverse push-off of a Legendrian graph and we determine its self linking number for Legendrian θ−graphs. In the case of topologically planar θ−graphs, we prove that the topological type of the transverse push-off is that of a pretzel link. 1
We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we a...
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R3....
We give an explicit formula to compute the rotation number of a nullhomologous Legendrian knot in co...
Abstract. We investigate Legendrian graphs in (R3, ξstd). We extend the classical invariants, Thurst...
Abstract. For a knot K the cube number is a knot invariant defined to be the smallest n for which th...
For a knot K the cube number is a knot invariant defined to be the smallest n for which there is a c...
AbstractFor a knot K the cube number is a knot invariant defined to be the smallest n for which ther...
AbstractFor a knot K the cube number is a knot invariant defined to be the smallest n for which ther...
Abstract. In the note we study Legendrian and transverse knots in ratio-nally null-homologous knot t...
We write a program in Java to generate all grid diagrams of up to size 10. Using equivalence between...
Abstract. In the note we study Legendrian and transverse knots in rationally null-homologous knot ty...
In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the m(52) knot. Epstei...
Abstract. We establish an upper bound for the Thurston–Bennequin number of a Legendrian link using t...
We write a program in Java to generate all grid diagrams of up to size 10. Using equivalence between...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2001.Includes bibliogr...
We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we a...
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R3....
We give an explicit formula to compute the rotation number of a nullhomologous Legendrian knot in co...
Abstract. We investigate Legendrian graphs in (R3, ξstd). We extend the classical invariants, Thurst...
Abstract. For a knot K the cube number is a knot invariant defined to be the smallest n for which th...
For a knot K the cube number is a knot invariant defined to be the smallest n for which there is a c...
AbstractFor a knot K the cube number is a knot invariant defined to be the smallest n for which ther...
AbstractFor a knot K the cube number is a knot invariant defined to be the smallest n for which ther...
Abstract. In the note we study Legendrian and transverse knots in ratio-nally null-homologous knot t...
We write a program in Java to generate all grid diagrams of up to size 10. Using equivalence between...
Abstract. In the note we study Legendrian and transverse knots in rationally null-homologous knot ty...
In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the m(52) knot. Epstei...
Abstract. We establish an upper bound for the Thurston–Bennequin number of a Legendrian link using t...
We write a program in Java to generate all grid diagrams of up to size 10. Using equivalence between...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2001.Includes bibliogr...
We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we a...
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R3....
We give an explicit formula to compute the rotation number of a nullhomologous Legendrian knot in co...