On calculation of the group of automorphisms of hyperelliptic curves (Q2211308): Difference between revisions

Using techniques going back to Hurwitz and Weierstrass in the 1800s, the authors describe a technique for algorithmically constructing the autmorphism group of a hyperelliptic curve of any genus. The theory behind this is discussed in \S 2. They have implemented this in the mathematical software system \texttt{SageMath}, which they discuss in \S 3. In \S 4, they illustrate their algorithm using the three examples \begin{itemize} \item[1.] \(X:\ y^2=x(x^2-1)(x^2-4)\), for which their program gives \(Aut(X)=C_2\times C_2\) (the Klein \(4\)-group), \item[2.] \(y^2=x(x^2-1)(x^2-4)(x^2-9)\) for which their program gives \(Aut(X)=C_4\) (cyclic group of \(4\) elements), and \item[3.] \(y^2=x(x^5-1)\) for which their program gives \(Aut(X)=C_5\) (cyclic group of \(5\) elements). \end{itemize} The computer code itself can be downloaded from the first author's website.