Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
0 answers
325 views

Is there an algorithm to compute a Belyi map for the Riemann surface?

Let $y^2=x^5-x-1$ be an affine model of a projective complex curve, is there an algorithm to compute the Belyi map (preferably of small degree), i.e., map to the projective line ramified only at $\{0,...
3 votes
0 answers
190 views

Construction of algebraic curves using line bundles on graphs

In this paper http://arxiv.org/abs/0707.1309 Matthew Baker and Serguei Norine, construct a analogue of the Riemman Roch formula for Lineal Systems defined on graphs. In the paper http://arxiv.org/abs/...
8 votes
2 answers
920 views

Is there an algorithm to compute efficiently the dessin d'enfant from a Belyi pair?

Let $(X,f)$ be a Belyi pair, i.e. a Riemann surface $X$ together with a morphism $f: X \to \mathbb{P}^1$, ramified only in $0,1, \infty$. Grothendieck's dessin d'enfant is the pre-image $G$ of the ...
3 votes
1 answer
215 views

number of ribbon structures (or punctured surfaces) on a graph

Suppose $G$ is connected undirected graph. Does the calculation of the number of topologically distinct punctured surfaces that can arise from putting a ribbon structure on $G$ exist in the ...
4 votes
0 answers
972 views

Questions about dessin d'enfants, trees and their Shabat polynomials

This will be a series of questions, a few of which have been troubling me for quite a while now. Before I jump right in, let me first introduce a few notions which I will assume. (Note: All of these ...