Computing Chebyshev knot diagrams
classification
🧮 math.GT
keywords
chebyshevknotpolynomialwhencomputingcurvedefinesdegree
read the original abstract
A Chebyshev curve C(a,b,c,\phi) has a parametrization of the form x(t)=Ta(t); y(t)=T_b(t) ; z(t)= Tc(t + \phi), where a,b,c are integers, Tn(t) is the Chebyshev polynomial of degree n and \phi \in \RR. When C(a,b,c,\phi) has no double points, it defines a polynomial knot. We determine all possible knots when a, b and c are given.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.