Roland van der Veen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Roland van der Veen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Christine Ruey Shan Lee2 shared publications
- Dror Bar-Natan
University of Toronto, Toronto, Canada
2 shared publications - Stavros Garoufalidis
Southern University of Science and Technology, Shenzhen, P. R. China
2 shared publications - Christine Ruey Shan Lee
Department of Mathematics and Statistics, University of South Alabama, Mobile, USA
1 shared publication
Latest Publications
- Open Access
The Slope Conjecture for Montesinos knots
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for the colored Jones polynomial of such knots with the parameters that describe their corresponding incompressible surfaces via the Hatcher-Oertel algorithm.
Open AccessThe Slope Conjecture for Montesinos knots
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for the colored Jones polynomial of such knots with the parameters that describe their corresponding incompressible surfaces via the Hatcher-Oertel algorithm.
- Open Access
- 18 October 2018
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 147 (1) , 377-397
A polynomial time knot polynomial
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
- 18 October 2018
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 147 (1) , 377-397
Open AccessA polynomial time knot polynomial
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
- Open Access
Colored Jones polynomials without tails
We exhibit an infinite family of knots with the property that the first coefficient of the n-colored Jones polynomial grows linearly with n. This shows that the concept of stability and tail seen in the colored Jones polynomials of alternating knots does not generalize naively.
Open AccessColored Jones polynomials without tails
We exhibit an infinite family of knots with the property that the first coefficient of the n-colored Jones polynomial grows linearly with n. This shows that the concept of stability and tail seen in the colored Jones polynomials of alternating knots does not generalize naively.
- Open Access
A polynomial time knot polynomial
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
Open AccessA polynomial time knot polynomial
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
- Open Access
Quadratic integer programming and the slope conjecture
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones polynomial can be computed by a suitable (almost tight) state sum and the solution of a corresponding quadratic integer programming problem. We illustrate this principle for a 2-parameter family of 2-fusion knots. Combined with the results of Dunfield and the first author, this confirms the Slope Conjecture for the 2-fusion knots.
Open AccessQuadratic integer programming and the slope conjecture
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones polynomial can be computed by a suitable (almost tight) state sum and the solution of a corresponding quadratic integer programming problem. We illustrate this principle for a 2-parameter family of 2-fusion knots. Combined with the results of Dunfield and the first author, this confirms the Slope Conjecture for the 2-fusion knots.
- Open Access
Slopes for Pretzel Knots
Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of the colored Jones polynomial of such knots determine a boundary slope as predicted by the Slope Conjecture, and that the linear term in the degrees correspond to the Euler characteristic of an essential surface.
Open AccessSlopes for Pretzel Knots
Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of the colored Jones polynomial of such knots determine a boundary slope as predicted by the Slope Conjecture, and that the linear term in the degrees correspond to the Euler characteristic of an essential surface.