English

A polynomial parametrization of torus knots

History and Overview 2007-12-17 v1

Abstract

For every odd integer NN we give an explicit construction of a polynomial curve \cC(t)=(x(t),y(t))\cC(t) = (x(t), y (t)), where degx=3\deg x = 3, degy=N+1+2\pentN4\deg y = N + 1 + 2\pent N4 that has exactly NN crossing points \cC(ti)=\cC(si)\cC(t_i)= \cC(s_i) whose parameters satisfy s1<...<sN<t1<...<tNs_1 < ... < s_{N} < t_1 < ... < t_{N}. Our proof makes use of the theory of Stieltjes series and Pad\'e approximants. This allows us an explicit polynomial parametrization of the torus knot K2,NK_{2,N}.

Keywords

Cite

@article{arxiv.0712.2408,
  title  = {A polynomial parametrization of torus knots},
  author = {Pierre-Vincent Koseleff and Daniel Pecker},
  journal= {arXiv preprint arXiv:0712.2408},
  year   = {2007}
}
R2 v1 2026-06-21T09:54:13.629Z