7
$\begingroup$

Suppose I am given two smooth projective curves $C_1$ and $C_2$ over a field $k$ I want to know if there is an algorithm to decide whether there exists a nonconstant (and thus dominant) map $f : C_1 \to C_2$.

To make this question more precise, suppose I am given an affine plane models $f_1(x, y) = 0$ and $f_2(x, y) = 0$ for some polynomials $f_1, f_2 \in k[x,y]$ birationally equivalent to the curves $C_1$ and $C_2$. Then is there an algorithm to determine when there exists a nonconstant map $f : C_1 \to C_2$ defined over $k$? Of course, it suffices to find a nonconstant rational map between these affine models so we may reduce the problem to asking if there exist two nonconstant polynomials $a(x,y), b(x,y) \in k[x,y]$ such that $f_2(a(x,y), b(x,y)) \in f_1(x,y) \cdot k[x,y]$.

From Riemann-Hurwitz we can easily bound the degree of a possible morphism $f : C_1 \to C_2$ so it suffices to find an algorithm to compute if there exist morphisms $f : C_1 \to C_2$ of a fixed degree $n$.

I am particularly interested in the case for morphisms of degree $2$ and $3$ and $k = \overline{\mathbb{F}_p}$ for my own applications. However, I am interested also in the general case out of curiosity if this problem is decidable.

Thank you in advance for any suggestions. If there is an (efficient) algorithm known I would be very appreciative if somebody could point me to it in the literature or to an implementation if one exists.

$\endgroup$
12
  • 2
    $\begingroup$ (1): You mean Hurwitz, not Hurewicz. They are different people. If you believe that this distinction is unimportant then ask yourself this: how soon do you want to be confused with another person? (2) The Tate conjecture (a theorem for several decades) says that two elliptic curves over a finite field are isogenous if their zeta functions are equal. However, this has, as far as I know, not been made effective. $\endgroup$
    – inkspot
    Commented Aug 16, 2020 at 16:07
  • 5
    $\begingroup$ Since you have the degree bound, this is a question about solvability of a polynomial system of equations. This general problem is decidable (in principle), and the algorithm is called "elimination theory". So the question can only be "how fast and effective this algorithm can be made for your specific problem". $\endgroup$ Commented Aug 16, 2020 at 16:15
  • 1
    $\begingroup$ You might find some of the results and references in this paper arxiv.org/abs/1711.00125 useful $\endgroup$ Commented Aug 16, 2020 at 18:13
  • 2
    $\begingroup$ G. Möhlmann, Einbettungen globaler Funktionenkörper Diplomarbeit TU Berlin 2008 $\endgroup$ Commented Aug 16, 2020 at 20:01
  • 2
    $\begingroup$ @AlexandreEremenko But the answer to Hilbert's 10th problem is not known e.g. for Q. Elimination theory will work only over algebraically closed fields. $\endgroup$ Commented Aug 16, 2020 at 20:30

0

You must log in to answer this question.

Browse other questions tagged .