Abstract
Let $E$ be a smooth cubic. A plane curve $D$ is said to be an $n$-contact curve to $E$ if the intersection multiplicities at each intersection point between $E$ and $D$ is $n$. In this note, we give an algorithm to produce possible candidates for $n$-contact curves to $E$ and consider its application.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have