Section: New Results
Computing Chebyshev knot diagrams
A Chebyshev curve has a parametrization of the form ; ; , where are integers, is the Chebyshev polynomial of degree and . When is nonsingular, it defines a polynomial knot. In , we determine all possible knot diagrams when varies. Let be integers, is odd, , we show that one can list all possible knots in bit operations, with .