Siegel's theorem and the Shafarevich conjecture (Q1940474)

Let \(f\) be a rational function on a curve \(C\) defined over a number field \(K\). The theorem of Siegel asserts that the number of \(k\)-points \(P\) on \(C\) such that their image \(f(P)\) is in the ring of integers of \(K\), localized at a suitable finite set \(S\) of places \(S\), is finite. In general we don't know an effective algorithm for computing the set of these points. The author aims at providing such an effective algorithm for the case of genus \(2\) curves or more generally for hyperelliptic curves. Let \(\mathcal{H}(g,k,S) \) denote the set of nonsingular projective hyperelliptic curves of genus \(g\) with good reduction outside \(S\) and \(\mathcal{H}'(g,k,S)\) be the set of \(k\)-isomorphism classes of nonsingular projective hyperelliptic curves over \(k\) of genus \(g\) such that their Jacobian has good reduction outside \(S\). The Shafarevich conjecture for abelian varieties (now a theorem proved by Faltings) asserts that the set \(\mathcal{H}'(g,k,S)\) is finite. The main theorem of the author asserts that if there is an effective algorithm in order to compute the set \(\mathcal{H}'(g,k,S)\) (by giving an explicit hyperelliptic Weierstrass equation for each class of the set \(\mathcal{H}'(g,k,S)\)), then an effective version of Siegel's theorem can be provided. Notice that the set \(\mathcal{H}(g,k,S) \) is known to be effectively computable [\textit{R. von Känel}, An effective proof of the hyperelliptic Shafarevich conjecture and applications, PhD thesis, Eidgenössische Technische Hochschule Zürich (2010)] so an effective version of Shafarevich conjecture is about understanding the difference of the inclusion \(\mathcal{H}(g,k,S) \subset \mathcal{H}'(g,k,S)\). The proof of main theorem is based on a modification of Parshin's idea on how the Mordell conjecture could be proved using the Shafarevich conjecture.