An explicit construction for \(n\)-contact curves to a smooth cubic via divisions of polynomials and Zariski tuples (Q2105254)

The authors give an algorithm for finding \textit{\(n\)-contact curves} for a given elliptic curve \(E\). Given a plane curve \(C\), an \(n\)-contact (plane) curve \(D\) of \(C\), is one such the intersection multiplicity at each point in \(C\cap D\) is \(n\). If \(E=C\), the curve \(D\) is also known as a curve of type \((d,n)\), where \(d\) is the degree of \(D\). For the algorithm, one can assume that all points of \(E\cap D\) are affine, the authors then require the determination of an \(n\)-torsion affine point \(P\in E\) that can be written as the sum of \(k\) affine points of \(E\), where 3 divides \(nk\). The algorithm first provides a candidate weak \(n\)-contact curve i.e. a curve that intersects \(E\) at these \(k\) points, each with multiplicity \(n\), and possibly intersects the point at infinity. This candidate weak \(n\)-contact curve is obtained via the Mumford-representation of the divisor consisting of only these \(k\) points. The algorithm then gives a procedure to obtain the \(n\)-contact curve from the weak \(n\)-contact curve. After some examples in Section 4, the authors discuss its application in obtaining Zariski \(k\)-plets [\textit{T. Shirane}, Proc. Am. Math. Soc. 145, No. 3, 1009--1017 (2017; Zbl 1358.14018)].