Families of curves for which the Belyi degree can be easily bounded - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-26T04:58:43Z http://mathoverflow.net/feeds/question/68213 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/68213/families-of-curves-for-which-the-belyi-degree-can-be-easily-bounded Families of curves for which the Belyi degree can be easily bounded Ariyan Javanpeykar 2011-06-19T14:54:00Z 2012-06-18T19:32:06Z <p>I know (edit: three) families of smooth projective connected curves over $\bar{\mathbf{Q}}$ for which the Belyi degree is not hard to bound from above. </p> <ol> <li><p>The modular curves $X(n)$. They are constructed by compactifying the quotient $Y(n) = \Gamma(n)\backslash \mathbf{H}$. The natural morphism $X(n) \longrightarrow X(1)$ is Belyi of degree $n^2$ (up to a constant factor). This also bounds the Belyi degree of a modular curve given by a congruence subgroup $\Gamma$. In general, Zograf proves that the Belyi degree of a (classical congruence) modular curve is bounded by $128(g+1)$.</p></li> <li><p>The Fermat curves $F(n)$. They are given by the equation $x^n+y^n+z^n =0$ in $\mathbf{P}^2$. The morphism $(x:y:z)\mapsto (x^n:z^n)$ is Belyi of degree $n^2$. It is known that $F(n)$ is <strong>not</strong> a modular curve for $n$ big enough. So this example is really different than the one above. (Also note that $n^2\leq 10g+10$ by the Plucker formula.)</p></li> <li><p>Wolfart curves are curves $X$ over $\overline{\mathbf{Q}}$ with a Galois Belyi morphism $X\to \mathbf{P}^1$; I took this terminology from a preprint by Pete L. Clark. Such curves are also called Galois Belyi covers or Galois three-point covers in the literature. The Belyi degree of a Wolfart curve is bounded by $84(g-1)$. (In particular, the latter implies that there are only finitely many Wolfart curves of given genus.)</p></li> </ol> <p>The following family of curves is not so easily dealt with.</p> <ol> <li>For an elliptic curve $E$ over the rational numbers, the Belyi degree can be bounded in the height of the $j$-invariant of $E$ following Belyi's proof of his theorem. This was written down explicitly by Khadjavi and Scharaschkin.</li> </ol> <p>I'm looking for families of curves for which the Belyi degree is easy to read off''. That is, a collection (finite or infinite) of smooth projective connected curves $X_i$ over $\bar{\mathbf{Q}}$ for which the Belyi degree can be bounded easily. </p> <p>Are there any other nice examples?</p> http://mathoverflow.net/questions/68213/families-of-curves-for-which-the-belyi-degree-can-be-easily-bounded/68264#68264 Answer by JSE for Families of curves for which the Belyi degree can be easily bounded JSE 2011-06-20T04:08:45Z 2011-06-20T15:49:22Z <p>I don't think this question is going to have a GREAT answer -- your examples 1 and 2 are HANDED to you as Belyi covers of the line, and I'd think any family that doesn't immediately present itself in this way is unlikely to offer an easy upper bound on Belyi degree.</p> <p>But that's not an answer, so here's one more -- any Hurwitz curve parametrizing covers of P^1 branched at four points will have a Belyi map (namely, the map to M_{0,4}) whose degree you can read off quite directly.</p> http://mathoverflow.net/questions/68213/families-of-curves-for-which-the-belyi-degree-can-be-easily-bounded/68298#68298 Answer by Noam D. Elkies for Families of curves for which the Belyi degree can be easily bounded Noam D. Elkies 2011-06-20T16:33:04Z 2011-06-20T19:07:52Z <p>Another example, like JSE's, that comes already equipped with a Belyi map but is not as familiar as modular curves and Fermat curves: For any relatively prime integers $m,n$ with <code>$0&lt;m&lt;n$</code>, and any subgroup $G$ of $S_n$, the curve that parametrizes trinomials $x^n + a x^m + b$ up to scaling with Galois group contained in $G$. The Belyi map is the invariant $a^n/b^{n-m}$ of the trinomial, and its degree is $d=[S_n:G]$; it is branched at $0$, $\infty$, and $(-n)^n/(m^m (n-m)^{n-m})$. One may assume $m \leq n/2$ (by symmetry with respect to $x \leftrightarrow 1/x$, $m \leftrightarrow n-m$). Some nontrivial examples with $n=5,7,8$ are given explicitly at <a href="http://www.math.harvard.edu/~elkies/trinomial.html" rel="nofollow">http://www.math.harvard.edu/~elkies/trinomial.html</a>; the subsequent paper with N.Bruin on the cases $(m,n) = (1,7)$ and $(1,8)$ with $d = 30$ is</p> <p>Nils Bruin and Noam D. Elkies, Trinomials $ax^7+bx+c$ and $ax^8+bx+c$ with Galois Groups of Order 168 and $8 \cdot 168$, <em>Lecture Notes in Computer Science</em> <strong>2369</strong> (proceedings of ANTS-5, 2002; C.Fieker and D.R.Kohel, eds.), 172-188.</p> <p>(These examples all have $G$ transitive, but the construction works for all subgroups $G$.) </p>