Next Article in Journal
Finite Element Method-Based Elastic Analysis of Multibody Systems: A Review
Next Article in Special Issue
Detection of Multi-Pixel Low Contrast Object on a Real Sea Surface
Previous Article in Journal
A Non-Iterative Method for the Difference of Means on the Lie Group of Symmetric Positive-Definite Matrices
Previous Article in Special Issue
s-Sequences and Monomial Modules
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Calculating Complete Lists of Belyi Pairs

by
Nikolai M. Adrianov
1 and
George B. Shabat
1,2,*
1
Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991 Moscow, Russia
2
Department of Mathematics, Logic and Intelligent Systems in Humanities, Russian State University for the Humanities, 125993 Moscow, Russia
*
Author to whom correspondence should be addressed.
Submission received: 17 December 2021 / Revised: 10 January 2022 / Accepted: 11 January 2022 / Published: 15 January 2022
(This article belongs to the Special Issue Combinatorial Algebra, Computation, and Logic)

Abstract

:
Belyi pairs constitute an important element of the program developed by Alexander Grothendieck in 1972–1984. This program related seemingly distant domains of mathematics; in the case of Belyi pairs, such domains are two-dimensional combinatorial topology and one-dimensional arithmetic geometry. The paper contains an account of some computer-assisted calculations of Belyi pairs with fixed discrete invariants. We present three complete lists of polynomial-like Belyi pairs: (1) of genus 2 and (minimal possible) degree 5; (2) clean ones of genus 1 and degree 8; and (3) clean ones of genus 2 and degree 8. The explanation of some phenomena we encounter in these calculations will hopefully stimulate further development of the dessins d’enfants theory.

1. Introduction

By definition, a Belyi pair is a pair ( X , β ) , where X is a complete smooth irreducible curve over an algebraically closed field k and β is a rational non-constant function on X with only three critical values. This short definition covers some enigmatic relations between several domains of mathematics. In the present paper, we mention just one of such relations that motivate the thorough investigation of Belyi pairs.
We identify the rational functions f k ( X ) and the branched covers of the projective line f : X P 1 ( k ) . For a non-constant f k ( X ) \ k , denote the set of its critical values by
CritVal ( f ) : = { c P 1 ( k ) # f 1 ( c ) < deg ( f ) } .
According to these notations, a Belyi pair is a pair ( X , β ) with such β k ( X ) \ k that
# CritVal ( β ) 3 .
The cases with # CritVal ( β ) < 3 are of little interest:
  • # CritVal ( β ) = 0 implies X = P 1 ( k ) and β ( z ) = ( a z + b ) / ( c z + d ) ;
  • # CritVal ( β ) = 1 is impossible;
  • # CritVal ( β ) = 2 implies X = P 1 ( k ) and β is equivalent to z z n with n N , n 2 .
Hence, we will consider only the case
# CritVal ( β ) = 3 .
Moreover, by post-composing β with an appropriate fractional-linear transformation, we can assume that
CritVal ( β ) = { 0 , 1 , }
and in most cases, we stick to this assumption.
A Belyi pair ( X , β ) is called clean if all the ramifications of β over 1 are 2-fold; in other words, for P X
[ β ( P ) = 1 ] [ β 1 m P 2 \ m P 3 ] ,
where m P O P is the maximal ideal in the local ring of a point P, and for a set S O P , we denote by S the ideal generated by S.
From now on, assume
char ( k ) 2 .
Then, the assumption of cleanness is not really restrictive since, for any Belyi pair, ( X , β ) the pair X , 4 β ( 1 β ) is clean.
Over the ground field k = C , the relation of Belyi pairs with combinatorial topology is rather direct. If ( X , β ) is a clean Belyi pair over C , then the pre-image of the segment X 1 : = β 1 [ 0 , 1 ] is such a graph
X 1 X
that
t h e c o m p l e m e n t X \ X 1 i s h o m e o m o r p h i c t o a d i s j o i n t u n i o n o f 2 c e l l s .
The embeddings X 1 X of graphs into compact oriented surfaces enjoying this property were studied for some time—see, e.g., [1]. From the combinatorial point of view, it looks like a natural partner of the classical theory of graph enumeration (see [2]). However, the theory of graph embeddings satisfying (1) turned out to be much more related to other domains of mathematics and physics. An example of relations with gauge theories can be found in [3]; relations with computer science and neural networks are discussed in [4].
From now on, we return to algebraic geometry.
Alexander Grothendieck, one of the central figures of algebraic geometry in 20th century, became interested in the embeddings satisfying (1) in rather peculiar circumstances. In the beginning of the 1970s, he abandoned the mathematical community for certain non-mathematical reasons (see mathematicians’ explanations in [5]) and returned to his mother university in Montpellier. There, he had to supervise the research of students with a very modest background, so Grothendieck’s native domains turned out to be inappropriate. Having to choose some elementary one, he started to study (assisted a bit by his students) the graphs on surfaces with the property (1). He called them dessins d’enfants due to their apparent simplicity, and in some time, this term became more popular than the previous ones—maps, orgraphs, etc.
The Montpellier period of Grothendieck’s active mathematical life is covered approximately by the years 1972–1984. During the first half of this period, he worked as a combinatorial topologist and rediscovered a beautiful group-theoretical method of describing dessins d’enfants. However, the most important event happened in the middle of this period: in 1978, he became aware (thanks to their former student Pierre Deligne with whom he still kept in contact) of the result of the Soviet mathematician Gennady Belyi [6]. According to Belyi’s theorem, the (appropriately defined) category of dessins d’enfants is equivalent not only to the category of Belyi pairs over C (which is more or less clear from the above explanations) but to such a category over the field Q ¯ of algebraic numbers!
Grothendieck was emotionally struck with this result and saw it as a fantastic one. From a personal point of view, it meant that his attempt to abandon algebraic geometry in favor of more elementary objects failed: the two turned out to be firmly related. From the general mathematical perspective, putting together the mentioned results provide the action of the absolute Galois group Aut Q ¯ on the isotopy classes of dessins d’enfants! It was realized soon (see [7]) that this action is faithful.
Thus, the theory of dessins d’enfants provides the unique opportunity of the visualization of the absolute Galois group. Of course, this is just one of the many consequences of the above category equivalence, but it is one of the main motivations of the calculations presented below.
In more general terms, we have two very different categories of objects: C 1 and C 2 (in our case, dessins d’enfants and Belyi pairs over Q ¯ ). The categories are essentially small (the term suggested by P. Deligne instead of the existence of a small subcategory containing object of all the classes of isomorphism), i.e., the classes of their isomorphic objects constitute sets. Denote these sets | C 1 | and | C 2 | . Each object of both categories is defined by a finite amount of information, and there is a theory establishing the one-to-one correspondence
| C 1 | | C 2 |
The true nature of this correspondence for the time being is understood poorly; otherwise, its existence would not be so surprising. In the hope of its better understanding, the authors participate for several decades in the calculation of particular cases. (It is a rather active international activity, see, e.g., [8].) In the present paper, we demonstrate some results obtained on the PC’s using MAPLE and avoiding any advanced techniques of calculation. Our strategy is to analyze (2) as detailed as possible within the objects of bounded complexity (the number of edges and the genus of the surface on the one hand and the degree of Belyi map and the genus on the other).
The dissemination of the dessins d’enfants theory was initiated by the famous informal text [9]. The rigorous basic definitions of this theory, and the main theorems together with the first examples were published in [10]; the monographic expositions can be found in [11,12]. The papers [13,14] contain more recent overviews, including some computer calculations.
The previously known calculations of Belyi pairs of positive genus are mostly related to the special (highly symmetrical) curves; they were investigated actively since 18th–19th century by Bring, Hurwitz, Klein, Wiman, etc. For the general dessins of positive genus, the known results are somewhat fragmentary. The ongoing project of compiling the database of Belyi pairs (see the recent report [8]) covers the complete lists up to degree 6 and some fragmentary results up to degree 9 and genus 3 . The complete list of the clean Belyi pairs with 4 edges (and hence degree 8 ), containing 134 cases, was published in the catalog [15] without calculations. In the present paper, the details of the calculations of all four cases of genus 2 are given, two of them rather hard and requiring computer calculations. These results are presumably new.
The authors are indebted to the participants of the Moscow State University seminar “Graphs on surfaces and curves over number fields”, A. D. Mednykh and A. K. Zvonkin, for their interest. The most difficult results of this paper could not be obtained without the contribution of S. Yu. Orevkov, who performed some computer calculations several years ago.

2. Belyi Pairs of Genera 0 and 1

2.1. On Plane Trees

In the genus-0 case, the most complete results are known when there is only one cell in the above condition (1), i.e., when the complement S 2 \ X 1 in the 2-sphere is homeomorphic to the disk. It happens if X 1 is a tree; the corresponding Belyi functions are called Shabat polynomials. The general self-contained introduction to the theory can be found in [16].
The first complete list of plane trees and their Shabat polynomials was presented in [17]; it covered the trees with ≤ eight edges. The trees with nine edges were covered in [18] and with ten edges in [19]. The length of the answers in the last paper shows that the complete lists of Shabat trees with 11 edges are out of reach—not because the calculations are unfeasible but because the answers become too long and complicated. However, there are some extremely interesting trees with 11 edges (see [20]).
In the remaining part of the paper, we concentrate on the Belyi functions that are the most natural generalizations of polynomials: the rational functions with the unique pole; they correspond to unicellular dessins.

2.2. Unicellular Toric Dessins

We give a complete list of the four-edged of them. The corresponding Belyi maps (without calculations) were collected in the catalog [15] and the details of calculations explained in [21], from which we borrow the central points.
All the toric dessins are drawn by graphs either inside the square or inside the hexagon; in both cases, the identification of the opposite sides are assumed.
The dessins are labeled by the tuples a 1 a 2 a 3 | 8 or a 1 a 2 a 3 | 8 n ; they are defined by the 0-valencies a 1 , a 2 , a 3 , while the number 8 indicates the common (for all of them) 2-valency, i.e., the order of the only pole of the Belyi function. In the cases when the tuples of valencies have several realizations, their names have the form a 1 a 2 a 3 | 8 n or a 1 a 2 a 3 | 8 n ± ; the first type is used for the real (i.e., isomorphic to their mirror reflections) dessins; the names a 1 a 2 a 3 | 8 n + and a 1 a 2 a 3 | 8 n are used for the pairs of mirror-symmetric dessins. The letters n, as well as the signs + and −, are chosen arbitrarily.
We suppress the notations of the support of a dessin but denote its affine model by the equation y 2 = f , where the cubic polynomial f C [ x ] has no multiple roots. The pole C is supposed to lie in the infinite point; therefore, the Belyi function β is regular on the affine part of the curve and has the form
β = U + V y ,
where U C [ x ] , V C [ x ] , deg U = 4 , deg V = 2 .
The vertices are denoted by A 1 , A 2 and A 3 and are numbered according to valencies non-decreasing, while “edge midpoints” are denoted by B 1 , B 2 , B 3 and B 4 .
The divisorial relations have the form
div ( β ) = a 1 A 1 + a 2 A 2 + a 3 A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C ,
with five possibilities for the tuples of valencies:
a 1 a 2 a 3 { 332 , 422 , 431 , 521 , 611 } .
All unicellular four-edged toric dessins are shown in Figure 1. The completeness of this list (as well as the other lists in [15]) was checked by N. Amburg and V. Nasretdinova using computer calculations based on matrix models. Furthermore, it is possible to enumerate dessins with a prescribed passport (the set of valencies of vertices and faces of the dessin; see [12] for the definition) either using character theory of symmetric groups and GAP or applying the wonderful explicit formula for unicellular dessins by Goupil–Schaeffer [22].

2.2.1. Some Theory

The calculations of the corresponding Belyi functions are not totally automatic: the two lemmas (Lemmas 1 and 2) are used.
Lemma 1
(The central symmetry criterion). A toric dessin is centrally symmetric if and only if it can be realized by a Belyi pair with an even Belyi function (i.e., β ( P ) = β ( P ) for all points P on the elliptic curve). In other words, if and only if the corresponding curve can be defined by an equation
y 2 = f ( x ) ,
where f is a polynomial of degree 3 or 4 in such a way that the Belyi function depends only on x.
Proof. 
Suppose the dessin is centrally symmetric. Then, the underlying elliptic curve has an automorphism ι of order 2 with fixed points such that the β = β ι . One can choose a model y 2 = f ( x ) such that this automorphism has the form ι : ( x , y ) ( x , y ) . The Belyi function β = U + V y is invariant under ι iff V 0 .
The inverse is trivial: if β depends only on x, then it is obviously invariant under ι : ( x , y ) ( x , y ) , so the dessin is centrally symmetric. □
Lemma 2
( ( 1 β ) -lemma (formulated and proved in [23])). Let β be a clean Belyi function corresponding to some dessin. The function 1 β is a square if and only if the graph of the dessin admits a bicolored structure.
Proof. 
Start with the particular case of the half of the lemma: if the graph of the square contains a loop, then 1 β is not a square.
Parametrize a loop by a real-analytic segment, whose map to the Riemann surface identifies only extremities (in the vertex of the loop). The function 1 β becomes a real-analytic function on the segment, which equals 1 on its extremities and has the only zero in the inner point, and has multiplicity two. If the function 1 β were the square of a meromorphic function on a whole surface, then on our segment would turn into a square of a function with the only simple zero in the inner point. However, in this case, this (new) function should take the values of the opposite signs in the extremities, and it would contradict the assumption, which the segment maps to a loop.
(We will use the other half). It is kind of obvious: the analytic continuation of the germ of a function 1 β considered in the small neighborhoods of any vertex is well-defined: choose the value ± 1 in this vertex and check that the function admits the continuation along all the edges. It will take the same value in the vertices of the same color and the opposite one in the vertices of the other color. The possibility of the meromorphic continuation of this function inside the cells follows from the definition of dessin d’enfant. □

2.2.2. Centrally Symmetric Dessins

There are four centrally symmetric cases in the list. The calculations are relatively easy, but computer algebra simplifies them considerably.
Dessin 332 | 8 . Divisorial relations take the form
div ( β ) = 3 A 1 + 3 A 2 + 2 A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C .
It is seen from the picture in Figure 1 that the set of nontrivial points of second order consists of one vertex (of valency 2) and two “edge midpoints”. Besides that, x ( A 1 ) = x ( A 2 ) .
One can suppose that
f = x x ( A 3 ) x x ( B 1 ) x x ( B 2 ) ;
then (taking into account that β = U and x ( B 3 ) = x ( B 4 ) ) we have
U = k x x ( A 1 ) 3 x x ( A 3 ) ,
U 1 = k x x ( B 3 ) 2 x x ( B 1 ) x x ( B 2 ) .
Using the affine ambiguity in the definition of x, choose the gauge, in which
x ( A 1 ) = x ( A 2 ) = 0 ,
x ( B 3 ) = x ( B 4 ) = 1 .
Denoting
x x ( B 1 ) x x ( B 2 ) = : x 2 + p x + q
and
x ( A 3 ) = : r ,
rewrite our equations in the form
f = ( x r ) ( x 2 + p x + q ) U = k x 3 ( x r ) U 1 = k ( x 1 ) 2 ( x 2 + p x + q ) .
Easy MAPLE calculations result (after replacing y by 3 y ) in the curve equation
y 2 = 3 x 4 3 x 2 + 2 x + 1
with j-invariant
j 332 = 219488 729 = 2 5 19 3 3 6 = 301.080932
The desired Belyi function has the form
β = x 3 ( 3 x 4 ) ,
which can be checked by the equality
β 1 = 3 x 2 + 2 x + 1 x 1 2 .
Dessin 422 | 8 a . Divisorial relations take the form
div ( β ) = 4 A 1 + 2 A 2 + 2 A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C .
It is immediately seen from the picture in Figure 1 that all the points of 2nd order are the vertices. Hence
f = x x ( A 1 ) x x ( A 2 ) x x ( A 3 )
and, taking into account β = U , x ( B 1 ) = x ( B 2 ) and x ( B 3 ) = x ( B 4 ) , we have
U = k x x ( A 1 ) 2 x x ( A 2 ) x x ( A 3 ) ,
U 1 = k x x ( B 1 ) 2 x x ( B 3 ) 2 .
Using the affine ambiguity in the definition of x, choose the gauge, in which
x ( A 1 ) = 0 ,
x ( A 2 ) = 1 .
Denoting
x x ( B 1 ) x x ( B 2 ) = : x 2 + p x + q
and
x ( A 3 ) = : t ,
rewrite our equations as
f = x ( x 1 ) ( x t ) U = k x 2 ( x 1 ) ( x t ) U 1 = k ( x 2 + p x + q ) 2 .
Easy MAPLE calculations result in the curve equation
y 2 = x ( x 1 ) ( x + 1 ) ,
which turns out to be famous with j-invariant
j 422 a = 1728 = 2 6 3 3 .
The desired Belyi function has the form
β = 4 x 2 ( x 1 ) ( x + 1 ) ,
which can be checked by the equality
β 1 = ( 2 x 2 1 ) 2 .
Dessin 422 | 8 b . Divisorial relations take the form
div ( β ) = 4 A 1 + 2 A 2 + 2 A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C .
It is immediately clear from the picture in Figure 1 that the set of points of second order consists of one vertex and two “edge midpoints”. Besides that, x ( A 2 ) = x ( A 3 ) .
One can assume that
f = x x ( A 1 ) x x ( B 1 ) x x ( B 2 ) ;
taking into account β = U and x ( B 3 ) = x ( B 4 ) , one has
U = k x x ( A 1 ) 2 x x ( A 2 ) 2 ,
U 1 = k x x ( B 3 ) 2 x x ( B 1 ) x x ( B 2 ) .
Using the affine ambiguity in the definition of x, choose the gauge, in which
x ( A 1 ) = 0 ,
x ( B 3 ) = x ( B 4 ) = 1 .
Denoting
x x ( B 1 ) x x ( B 2 ) = : x 2 + p x + q
and
x ( A 3 ) = : r ,
rewrite our equations as
f = x ( x 2 + p x + q ) U = k x 2 ( x r ) 2 U 1 = k ( x 1 ) 2 ( x 2 + p x + q ) .
Easy MAPLE calculations result in the curve equation
y 2 = x ( x 2 2 x 1 )
with j-invariant
j 422 b = 10976 = 2 5 7 3 .
The desired Belyi function has the form
β = x 2 ( x 2 ) 2 ,
which can be checked by the equality
β 1 = ( x 1 ) 2 ( x 2 2 x 1 ) .
Dessin 611 | 8 a . Divisorial relations take the form
div ( β ) = 6 A 1 + A 2 + A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C .
The corresponding picture in Figure 1 demonstrates the points of second order: the vertex of the valency 6, i.e., A 1 , and two “edge midpoints”. Besides that, x ( A 2 ) = x ( A 3 ) , x ( B 1 ) = x ( B 3 ) and x ( B 2 ) = x ( B 4 ) .
We have
f = x x ( A 1 ) f 1 ,
U = k x x ( A 1 ) 3 x x ( A 2 ) ,
U 1 = k x x ( B 1 ) 2 f 1 .
Using the affine ambiguity in the definition of x, choose the gauge, in which
x ( A 1 ) = 0 ,
x ( A 2 ) = 1 .
Denoting
f 1 = : x 2 + p x + q ,
rewrite our equations as
f = x ( x 2 + p x + q ) U = k x 3 ( x 1 ) U 1 = k ( x r ) 2 ( x 2 + p x + q ) .
Easy MAPLE calculations result in the curve equation
y 2 = x x 2 + 1 2 x + 3 16
with j-invariant
j 611 a = 4000 9 = 2 5 5 3 3 2 = 444.444444 .
The desired Belyi function has the form
β = 256 27 x 3 ( x 1 ) ,
which can be checked by the equality
β 1 = ( 4 x 3 ) 2 x 2 + 1 2 x + 3 16 .

2.2.3. The Bicolored Dessin

There remains the only bicolored non-centrally symmetric dessin. The complexity of the calculations is approximately the same as for the centrally symmetric ones.
Dessin 431 | 8 a . Divisorial relations take the form
div ( β ) = 4 A 1 + 3 A 2 + A 3 8 C ,
div ( β 1 ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C .
By the 1 β -lemma, it is possible to introduce the function α by the relation
1 β = α 2 .
Taking into account the bicolored structure, we obtain the curve equation
y 2 = a x 3 + b x 2 + c x + 1
with the relations
div ( β ) = 4 A 1 + 3 A 2 + A 3 8 C ;
x ( C ) = ;
x ( A 1 ) = 0 ;
y ( A 1 ) = 1 ;
β = 1 α 2 ;
div ( 1 α ) = 4 A 1 4 C ;
div ( 1 + α ) = 3 A 2 + A 3 4 C ;
α = p 0 + p 1 x + p 2 x 2 + q y .
The MAPLE calculations provide the curve equation
y 2 = 1 32 x + 2 9 x 2 + 16 + 8 x
with j-invariant
j 431 a = 207646 6561 = 2 · 47 3 3 8 = 31.648529 .
The desired Belyi function is
β = 9 64 x 4 x 3 77 36 x 2 20 9 x + x 2 + 16 9 x + 8 9 y 8 9 .

2.2.4. General Dessins

The level of calculations of the Belyi pairs for the remaining dessins is of a totally different class. They are definitely out of reach without computers, and the answers themselves are so cumbersome that they cannot even be fixed by the traditional technologies. Such a claim might not seem completely sound since one can suppose that in some different parameters, the answers are shorter. However, when the j-invariant of a curve hardly fits a screen, it guarantees that the curve has an incredibly high complexity.
We perform the calculations in several steps.
(a) Completing 1 β to a square. By the ( 1 β ) -lemma, for all the remaining dessins, the function 1 β is not a square. However, the divisor
div ( 1 β ) = 2 ( B 1 + B 2 + B 3 + B 4 ) 8 C
is principal, and its “half” B 1 + B 2 + B 3 + B 4 4 C has order 2; hence, the curve contains such a point D of second order that
B 1 + B 2 + B 3 + B 4 4 C D C
(as usual, we have assumed that C is the neutral element on the elliptic curves on which we are going to find the desired Belyi functions). According to ( 1 β ) -lemma, point D is one of the three non-trivial points of the second order on the curve.
Adding D C to both sides of the last equality, we find such a function ψ that
B 1 + B 2 + B 3 + B 4 4 C + ( D C ) = div ( ψ ) .
We have distinguished one of the non-trivial points of second order; therefore, we can write the curve equation in the form
y 2 = f = : ( x 1 ) ( a x 2 + b x 1 )
and assume
x ( D ) = 1 , y ( D ) = 0 .
Then
div ( x 1 ) = 2 ( D C ) .
Doubling (4) and using (3) and (5), we obtain (having multiplied ψ by a suitable non-zero constant)
( x 1 ) ( β 1 ) = ψ 2 .
(b) The important simplification. Since ψ L ( 4 C ) , there exist such polynomials P , Q C [ x ] satisfying deg P 2 , deg Q 1 that
ψ = P + Q y .
According to (6),
( x 1 ) ( β 1 ) = ( P + Q y ) 2 .
Expanding and using β = U + V y , we obtain
( x 1 ) ( U 1 ) = P 2 + Q 2 f ( x 1 ) V = 2 P Q .
Since the polynomial f is divisible by x 1 , the first equation of the system tells us that P is divisible by x 1 as well. Thus, we can introduce
P = : ( x 1 ) P 1 ,
where P 1 C [ x ] , deg P 1 1 . After dividing by x 1 , the last system takes the form
U 1 = ( x 1 ) P 1 2 + Q 2 ( a x 2 + b x 1 ) V = 2 P 1 Q .
(c) The common parametrization. The maximal 0-valency of all the remaining dessins (according to our conventions, the corresponding vertex is denoted A 1 ) is at least 4. More precisely,
div ( β ) = a 1 A 1 + a 2 A 2 + a 3 A 3 8 C ,
where ( a 1 a 2 a 3 ) { ( 611 ) , ( 521 ) , ( 431 ) } .
The condition β L ( 8 C 4 A 1 ) gives the possibility of eliminating the coefficients of (degree 1) polynomials P 1 and Q. The answer is:
P 1 = 1 2 p 1 x + p 0 S , Q = 1 2 q 1 x + q 0 S ,
where
p 1 = 4 a + 16 a 2 8 a b + 3 b 2 2 b 3 b 4 ,
p 0 = 8 a + 32 a 2 + 32 a b 6 b 2 + 8 b 3 2 b 4 ,
q 1 = 8 a + b 12 a b + 2 b 2 3 b 3 ,
q 0 = 2 + 24 a 8 b + 6 b 2 ,
S = 1 16 a + 4 b + 16 a 2 + 16 a b 6 b 2 + 4 b 3 b 4 .
In other words, all the remaining curves are defined by the equations
y 2 = ( x 1 ) ( a x 2 + b x 1 ) ,
while the Belyi functions on them are defined with the appropriate values of the parameters a , b by the relations (3), (7)–(14).
(d) Dessin 431 | 8 b . In terms of the introduced parameters, it can be found by a direct calculation: the curve is defined by the equation
y 2 = x 1 448 81 x 2 + 208 9 x + 1
with j-invariant
j 431 b = 10647696795116000 1853320108689 = 2 5 5 3 13859 3 3 8 7 10 = 5745.201137 .
The Belyi function on it has the form
β = 4096 250047 x 4 + 137216 1750329 x 3 + 7414528 12252303 x 2 + 2086912 9529569 x + 10240 1058841
8192 194481 x 2 + 152576 1361367 x + 10240 1058841 y .
This Belyi pair corresponds to parameter values ( a = 448 81 , b = 208 9 ) .
(e) Discriminant curve. It consists of such pairs ( a , b ) that the polynomial
U 2 V 2 f x 4
has a multiple root. The curve contains a component D I of genus 1, defined by the equation
0 = 36864 a 7 + 331776 b 2 344064 b + 94208 a 6
+ 233984 b 2 + 95232 b + 158976 b 4 2304 + 27648 b 3 a 5
+ 222976 b 4 768 b + 182016 b 5 + 32256 b 3 + 22272 b 2 a 4
+ 20512 b 4 + 72576 b 7 21888 b 5 9936 b 8 60608 b 6 + 1408 b 3 64 b 2 a 3
+ 1856 b 5 1296 b 10 10560 b 7 + 4560 b 6 16 b 4 5200 b 8 + 10656 b 9 a 2
+ 95 b 8 + 540 b 11 + 424 b 7 + 20 b 6 9 b 12 1020 b 9 50 b 10 a
+ 30 b 11 15 b 12 + 15 b 9 3 b 8 + 3 b 13 30 b 10 .
(f) Dessins 521 | 8 a , b ± . There are three points on the curve D I corresponding to the dessins under consideration; they constitute the cubic Galois orbit (the only one among the unicellular four-edged toric dessins). The corresponding parameters are the roots of the cubic equations
65536 a 3 238080 a 2 + 216425 a + 14000
and
64 b 3 272 b 2 + 1427 b 344 .
The approximate values indicate the coupling of these parameters:
( a = 0.060582 , b = 0.252495 )
correspond to the real dessin 521 | 8 a , while
( a = 1.846697 ± . 340363 i , b = 1.998752 ± 4.158426 i )
to the pair of complex-conjugate dessins 521 | 8 b ± . The irreducible cubic polynomial, the roots of which are the j-invariants of all the three curves, has the form
I 521 : = 56495049800000000000000 j 3 315629560922285350000000000 j 2
+ 748295885321347996073297265625 j 564055135320668135938721399828128 .
Its leading coefficient is the product of small primes:
56495049800000000000000 = 2 15 5 14 7 10 .
(g) Dessins 611 | 8 a , b . This quadratic Galois orbit correspond to the parameters
a = 3 64 ± 3 32 2 , b = 1 4 1 4 2 .
The j-invariants of the curves are
j = 1211356467233 847425747 ± 5287472423321 20338217928 2
that are the roots of the quadratic polynomial
I 611 : = 413643108486820613184 j 2 1182567927315693367354752 j
+ 789298737392595284292204382 .
Its leading coefficient is again the product of small primes:
413643108486820613184 = 2 6 3 4 7 20 .

2.2.5. Tables

In Table 1 and Table 2, we summarize some results of our calculations that can be expressed in terms of the rational numbers. None of them depend on the methods of calculations and on the (rather arbitrary) choices of normalizations.
Irrational j-invariants in Table 1 are the roots of the polynomials written down in the Section 2.2.4:
I 521 = 56495049800000000000000 j 3 315629560922285350000000000 j 2
+ 748295885321347996073297265625 j 564055135320668135938721399828128 ,
I 611 = 413643108486820613184 j 2 1182567927315693367354752 j
+ 789298737392595284292204382 .
The norms of these j-invariants are presented in Table 2.

3. Belyi Pairs of Genus 2

3.1. Overview

The difficulty of calculations of Belyi pairs grows rapidly with the genus; genus 2 is already very hard. There are several effective approximate methods; the subject is very interesting, but we do not discuss it in the present paper.
One of the difficulties in the exact calculations of Belyi pairs genus 2 is the absence of something as clear, easily calculable and totally accepted by the community as the j-invariant in genus 1. Sure there exists an analog, namely the tuple of Igusa invariants (see [24]) j 1 , j 2 , j 3 , j 4 , satisfying some polynomial relations, but there exist several normalizations of them, their annihilation and prime factors do not have the comprehensible (at least well-known) interpretation, etc. Thus, unlike the genus-one case, the result of a successful calculation of a Belyi pair cannot be summarized by an algebraic number.
In the table of computed Belyi pairs [8] on p. 376, the complete computations of Belyi pairs of genus 2 are performed only for the Belyi functions of degrees 5 (two pairs, see below) and 6 (seven pairs). It is, perhaps, just the matter of organization of computations since, among the pairs of degree 8, the two are very simple (see below).
In the present paper, we consider only the smallest possible degrees: 5 for the general pairs and 8 for the clean ones.

3.2. Belyi Pairs of Degree 5

The answers become shorter if we do not insist on the normalization CritVal ( β ) = { 0 , 1 , } .
The Fermat case. The answer
y 2 = 1 x 5 , β = y
is related to the particular case of the well-known Fermat family
x m + y n = 1 , β = x m = 1 y n ,
so we skip the details.
The Birch case. The computation was performed by Brian Birch long ago (in the pre-Grothendieck era) and published in [25].
We outline obtaining Birch’s answer by the method similar to the one used in the difficult cases of genus 1 calculations.
The only possible passport in the ( d , g ) = ( 5 , 2 ) case is ( 5 5 5 ) . In the obvious notations, it means that
div ( β ) = 5 A 5 C
and
div ( β 1 ) = 5 B 5 C
The straightforward computations show that the pairs ( X , f ) satisfying (15) are parametrized by the ( a , h ) -family of curves
w 2 = z 6 + a z 5 + 1 2 a 2 h 2 2 a + 9 z 4
+ 1 16 a 3 + 1 8 a 2 h 1 4 a h 2 1 2 h 3 1 8 a 2 3 2 a h 1 2 h 2 + 3 4 a + 9 2 h + 13 2 z 3
+ 1 2 a 2 h 2 2 a + 9 z 2 + a z + 1
with the function (defined up to the proportionality factor k)
f k = 4 z 2 + ( a 2 h + 2 ) z w + 4 z 5 + 3 a 2 h + 2 z 4 + a 2 a h 2 h 2 3 a + 22 z 3
+ a 2 a h 2 h 2 3 a + 22 z 2 + 3 a 2 h + 2 z + 4 .
Then, one finds that over the point
a = 3 , h = 1 2
the (16) is also satisfied with k = 1 4 . It yields Birch’s dessin from [25] in different coordinates:
w 2 = z 6 + 3 z 5 + 29 4 z 4 + 19 2 z 3 + 29 4 z 2 + 3 z + 1
β = z 2 + z + 1 w + z 5 + 5 2 z 4 + 5 z 3 + 5 z 2 + 5 2 z + 1
The other beautiful formulas for this curve were obtained by N. Elkies (see [25]) and Y. Fuertes and A. Mednykh [26].

3.3. Clean Belyi Pairs of Degree 8

The results of calculations of all the four clean Belyi pairs of degree 8 and genus 2 were published in [27] and included into the catalog [15]; the calculations themselves (rather cumbersome) were never published.
In this section, we mostly work over an arbitrary algebraically closed field k of characteristic 2 . When we draw something, we assume k = C .

3.3.1. Passport

If ( X , β ) is a clean Belyi pair of genus 2 and degree 8, then
div ( β ) = a 1 A 1 + + a α A α ( c 1 C 1 + + c γ C γ )
div ( β 1 ) = 2 ( B 1 + + B 4 ) ( c 1 C 1 + + c γ C γ )
div ( d β ) = ( a 1 1 ) A 1 + + ( a α 1 ) A α + B 1 + + B 4 ( c 1 + 1 ) C 1 + ( c γ + 1 ) C γ
with A 1 , , A α , B 1 , , B 4 , C 1 , , C γ X and a 1 , , a α , c 1 , , c γ N .
They all should satisfy
a 1 + + a α = c 1 + + c γ = 8
and
2 = deg ( d β ) = 8 α + 4 ( 8 + γ ) = 4 α γ ,
so α = γ = 1 . We conclude
div ( β ) = 8 A 8 C
div ( β 1 ) = 2 ( B 1 + + B 4 ) 8 C
div ( d β ) = 7 A + B 1 + + B 4 9 C
for some A ; B 1 , , B 4 ; C X . In the traditional language, it means that we work with the passport
8 8 2 2 2 2 .

3.3.2. Divisors of Finite Order

Let ( X , β ) be any of the considered Belyi pairs. Then, the above passport tells us that there exist such A , C X (it is always clear from the context whether A means a dessin or a point on a curve) that
div ( β ) = 8 A 8 C ,
hence
A C tors 8 ( Jac X ) .
Of course, the difference A C can actually have the smaller order in Jac X , i.e., 2 and 4, and it turns out that all the possibilities realize—see the claim in [27].
At this point, we shall call a Belyi pair ( X , β )  easy, if A C tors ( Jac X ) with { 2 , 4 } , and difficult, if A C tors 8 ( Jac X ) \ tors 4 ( Jac X ) . This classification will be specified soon.
Obviously, in the easy cases, β = α 4 or β = α 2 for some α k ( X ) 2 or α k ( X ) 4 , respectively.

3.3.3. Easy Cases

First, we point out the general properties of the easy Belyi pairs; the precise calculations will follow (Theorem 1).
Theorem 1.
(i) If A C tors 2 ( Jac X ) , then Aut ( X ) contains the cyclic group C 8 and the Belyi map is the factorization over this group:
β : X X C 8 .
(ii) If A C tors 4 ( Jac X ) \ tors 2 ( Jac X ) , then A and C are non-Weierstrass, and they are in hyperelliptic involution.
Proof. 
( i ) Fix α k ( X ) 2 , satisfying β = α 4 . Since div ( α ) = 2 A 2 C , both A and C are the Weierstrass points. There are four remaining Weierstrass points, W 1 , W 2 , W 3 , W 4 , and the critical points of α are
{ A , C , W 1 , W 2 , W 3 , W 4 } .
Now since
CritVal ( β ) = { 0 , } { a 4 a CritVal ( α ) }
and since α ( A ) = 0 , α ( C ) = , we have
1 = α ( W 1 ) 4 = α ( W 2 ) 4 = α ( W 3 ) 4 = α ( W 4 ) 4 .
It follows from our assumption char ( k ) 2 that there is a primitive root of unity of degree 4, denoted as usual by i , and
{ α ( W 1 ) , α ( W 1 ) , α ( W 1 ) , α ( W 1 ) } = { ± 1 , ± i } .
Hence, X can be defined by the equation
y 2 = x 5 x
with α = x , and then the desired cyclic group is generated by ( x , y ) ( i x , i y ) , and we are finished. It follows that
β = x 4 .
( i i ) Introduce α k ( X ) 4 , satisfying β = α 2 , then α is not a square and
div ( α ) = 4 A 4 C .
Suppose C is Weierstrass. Then, there exists γ L ( 2 C ) \ k , and it can be normalized in such a way that α γ 2 has no pole in C and hence nowhere, so it is a (non-zero) constant. Taking differentials, we obtain d α = 2 γ d γ . Since d α | A = 0 and α ( A ) = 0 , then γ ( A ) 0 and hence d γ | A = 0 . Taking into account that deg γ = 2 , one can conclude that A is Weierstrass. Then α is a square, a contradiction.
In the same way, we check that A is non-Weierstrass; it suffices to replace β by 1 β and hence α by 1 α . □

3.3.4. Number of Realizations

As we already know from [27], over C , there are precisely four realizations of the above passport corresponding to the four possible ways of pasting the octagon (see Figure 2). The corresponding Gaussian words and the automorphism groups are presented in Table 3.
The completeness of our list can be checked by the Harer–Zagier numbers: introduce, following [28], the numbers
ε g ( n ) : = # { pastings of 2 n - gons with a marked edge of genus g } .
It is known that ε 2 ( 4 ) = 21 , and, indeed
21 = 8 · D { A , B , C 1 , C 2 } 1 # Aut ( D ) = 8 1 8 + 1 2 + 1 + 1 .

3.3.5. Some Qualitative Results

In this subsection, we denote the Belyi pairs corresponding to pastings by the Gaussian words defining pastings.
The certain properties of Belyi pairs follow immediately from the easy considerations in the category of dessins (Theorem 2).
Theorem 2.
(i) The Belyi pairs ( X , β ) a b c d a b c d and ( X , β ) a b a b c d c d are defined over Q ;
(ii) The remaining two, ( X , β ) a b a c b d c d and ( X , β ) a b a c d b c d , are Galois-conjugated over some Q ( D ) with D > 0 ;
(iii) All the four Belyi pairs are self-dual, i.e., satisfy ( X , β ) ( X , 1 β ) .
Proof. 
( i ) Both pairs ( X , β ) a b c d a b c d and ( X , β ) a b a b c d c d are defined uniquely by the triple invariants(degree, genus, Aut), so they are defined over Q .
Before the actual calculations, the statement ( i i ) is partially conjectural: from the known Galois-invariants, it follows that either ( X , β ) a b a c b d c d and ( X , β ) a b a c d b c d are also both defined over Q (separated by some finer Galois-invariants), or they constitute the two-element Galois orbit. The direct calculation will show below that the latter case holds, but we can already claim that the corresponding quadratic field of definition is real since ( X , β ) a b a c b d c d and ( X , β ) a b a c d b c d are not mutually mirror-symmetric.
The statement ( i i i ) follows from the self-duality of all the four pastings, which can be established by the direct pictorial analysis. □
As we have promised, we specify the terminology: from now on, we call the Belyi pairs ( X , β ) a b c d a b c d and ( X , β ) a b a b c d c d easy and ( X , β ) a b a c b d c d and ( X , β ) a b a c d b c d  difficult (Remark 1).
Remark 1.
As we shall see, the difficult pairs are defined over Q ( 2 ) . It would be interesting to be able to determine the discriminant of the field of definition of a dessin without the calculation of the corresponding Belyi pair.
Restore some notations. Let ( X , β ) be any of our four Belyi pairs. Then, according to the dessins d’enfants theory, since all our dessins have only one vertex and only one face, there exist such A , C X that
div ( β ) = 8 A 8 C ,
hence
A C tors 8 ( Jac X ) .
Of course, the difference A C can actually have the smaller order in Jac X , and it turns out that all the possibilities realize—see the claim in [27].
Our terminology is reformulated in the following (Theorem 3)
Theorem 3.
In the above notations, the differences satisfy
( i )
A C tors 2 ( Jac X a b c d a b c d ) ;
( i i )
A C tors 4 ( Jac X a b a b c d c d ) \ tors 2 ( Jac X a b a b c d c d ) ;
( i i i )
in the difficult cases A C tors 8 ( Jac X ) \ tors 4 ( Jac X ) .
Proof. 
Follows from the results below. The direct proofs in terms of dessins are also possible. □

3.3.6. Calculations

The easiest case X a b c d a b c d has been covered before; the answer is
y 2 = x 5 x , β = x 4
The easy case X a b a b c d c d . It follows from the symmetry considerations that there exists a degree-2 morphism of Belyi pairs
p : X a b a b c d c d Y a b a b ,
where Y a b a b is the toric dessin that is represented by a square with the opposite sides identified—see Figure 3 in which the vertices are marked in a way that will become clear in a while.
The Belyi pair ( Y a b a b , β 1 ) , corresponding to this dessin, is determined immediately. There is only the elliptic curve with the symmetry of the 4th order; it has the j-invariant 1728. We take the doubly-dotted curve for its affine model
Y ¨ : v 2 = u 4 1
and understand it as
Y ¨ = Y a b a b \ { ̲ ± } ,
where around the points ̲ ± , the asymptotic v ± u 2 holds.
Now recall the notations div ( β ) = 8 A 8 C and deduce from the geometry that
β = p * β 1 ,
hence, assuming that the branching points of p are p ( A ) = ̲ + and p ( C ) = ̲ , we conclude that
div ( β 1 ) = 4 ̲ + 4 ̲ .
Such a function turns out to be the square
β 1 = 1 2 u 4 + 2 u 2 v = ( u 2 v ) 2 .
Due to the identity ( u 2 v ) ( u 2 + v ) 1 , the polynomials u 2 ± v are non-constant units of the polynomial ring of an affine curve. The subject is classical: N.-H. Abel was interested in such polynomials since they provide the pseudo-elliptic integrals (see [29]).
To provide the appropriate branching, introduce the correspondences (two-valued “functions”)
x = u + 1 , y = v u + 1
which means introducing the affine model of X a b a b c d c d by the equation
x 2 y 2 = ( x 2 1 ) 4 1
together with the covering p : X a b a b c d c d Y a b a b defined by the pullbacks
p * u = x 2 1 , p * v = x y .
The Belyi function is defined by β = p * β 1 , i.e.,
β = ( x 2 1 ) 2 x y 2
as we have asserted above, it is a square.
The boxed formulas are easily transformed to the answers of [27]:
y 2 = x 6 4 x 4 + 6 x 2 4 , β = 2 x 8 + 8 x 6 12 x 4 + 8 x 2 1 + ( 2 x 5 4 x 3 + 2 x ) y
However, the special properties of the considered dessin are not so easily seen in this standard form as in the above formulas.
The difficult cases X a b a c b d c d and X a b a c b d c d . (The results are based on the computer calculation performed with the aid of S.Yu. Orevkov.) Due to the mentioned above self-duality, the desired Belyi pair is defined by the three recurrent polynomials. Namely, we consider the family of pairs ( X , Ψ ) , where X is a curve over an algebraically closed field and Ψ k ( X ) \ k . These pairs can be considered as the points of Hurwitz spaces. The affine model of where X is defined by the equation
y 2 = a x 6 + b x 5 + c x 4 + d x 3 + c x 2 + b x + a
and the function Ψ has the form
Ψ = A x 8 + B x 7 + C x 6 + D x 5 + E x 4 + D x 3 + C x 2 + B x + A
+ ( F x 5 + G x 4 + H x 3 + H x 2 + G x + F ) y
Here, the parameters ( a : b : c : d ) P 3 ( k ) , ( A : B : C : D : E ) P 4 ( k ) and ( F : G : H ) P 2 ( k ) are defined up to proportionality and satisfy
a A F 0 ,
so we could normalize the coefficients of the pair ( X , Ψ ) by a = A = F = 1 and look for the desired points (recall that there are two of them defined over the yet unknown quadratic extension of Q ) in the affine space A 9 ( k ) . However, then the arithmetical issues occur, so we prefer to keep our 12 unknown parameters a , , H free. The resulting family of curves over P 3 ( k ) with rational functions parametrized by the points of P 4 ( k ) × P 2 ( k ) is interesting for its own reason; we are looking for the two very special fibers in this family. See the general discussion in [30].
The points O ± X and ̲ ± X are defined by
x ( O ± ) = 0 , y ( O ± ) = ± a and x ( ̲ ± ) = 0 , y ± a x 3 as x .
(The choice of signs motivated by arithmetics). We are looking for the pairs ( X , Ψ ) satisfying
div ( Ψ ) = 8 O 8 ̲ .
after the appropriate choices O { O ± } , ̲ { ̲ ± } . (They are opposite by the geometric reasons; we do not discuss them here.)
After solving Equation (18) in y and plugging the result in (17), we obtain the condition for a recurrent polynomial
Z = z 0 x 16 + z 1 x 15 + + z 7 x 9 + z 8 x 8 + z 7 x 7 + z 1 x + z 0 k [ x , Ψ ] ,
for which Equation (19) is equivalent to
Z | Ψ = 0 k × [ a , , H ] x 8 ,
or to the system of polynomial equations
z 0 = z 1 = = 0
that we rewrite in the polynomial form
( 2 F 2 c + 2 F G a + 2 F G b + 2 F G d + 2 F H a + 2 F H b + 2 F H c + G 2 b + 2 G 2 c + 2 G H a
+ 2 G H b + 2 G H c + 2 G H d + H 2 b + 2 H 2 c + H 2 d 2 A B 2 B C 2 C D 2 D E ) x 7
+ ( F 2 a + 2 F 2 b + 2 F G a + 2 F G b + 2 F G c + 2 F H c + 2 F H d + 2 G 2 b + G 2 c + 2 G H a
+ 2 G H c + 2 G H d + H 2 a + 2 H 2 b + H 2 c 2 A C 2 B D 2 C E D 2 ) x 6
+ ( 2 F 2 a + F 2 b + 2 F G b + 2 F G c + 2 F H c + 2 F H d + 2 G 2 a + G 2 d
+ 2 G H b + 2 G H c + 2 H 2 a + H 2 b 2 A D 2 B E 2 C D ) x 5
+ ( F 2 c + 2 F G a + 2 F G d + 2 F H b + 2 F H c + G 2 c
+ 2 G H a + 2 G H b + H 2 a 2 A E 2 B D C 2 ) x 4
+ ( F 2 d + 2 F G c + 2 F H a + 2 F H b + G 2 b + 2 G H a 2 A D 2 B C ) x 3
+ ( F 2 c + 2 F G b + 2 F H a + G 2 a 2 A C B 2 ) x 2
+ ( F 2 b + 2 F G a 2 A B ) x
+ F 2 a A 2 0 .
The coefficients of the equation of the curve are eliminated straightforwardly
a = A 2 F 2 , b = 2 A ( A G B F ) F 3 ,
c = 2 A 2 F H 3 A 2 G 2 + 4 A B F G 2 A C F 2 B 2 F 2 F 4 ,
d = 2 F 5 ( A 2 F 2 H 3 A 2 F G H + 2 A 2 G 3 + 2 A B F 2 H 3 A B F G 2
+ 2 A C F 2 G A D F 3 + B 2 F 2 G B C F 3 )
leaving us with the system of four equations in polynomial form
( 2 A 2 F 4 G 2 A 2 F 4 H + 2 A 2 F 3 G 2 6 A 2 F 3 G H 4 A 2 F 3 H 2 2 A 2 F 2 G 3
+ 10 A 2 F 2 G 2 H 10 A 2 F 2 G H 2 6 A 2 F 2 H 3 2 A 2 F G 4 + 6 A 2 F G 3 H
+ 18 A 2 F G 2 H 2 + 6 A 2 F G H 3 8 A 2 G 4 H 4 A 2 G 3 H 2 2 A B F 5
4 A B F 4 G + 4 A B F 4 H + 2 A B F 3 G 2 12 A B F 3 G H + 2 A B F 3 H 2
+ 4 A B F 2 G 3 8 A B F 2 G 2 H 16 A B F 2 G H 2 4 A B F 2 H 3
+ 12 A B F G 3 H + 6 A B F G 2 H 2 + 4 A C F 5 + 4 A C F 4 H 4 A C F 3 G 2
+ 4 A C F 3 G H + 4 A C F 3 H 2 8 A C F 2 G 2 H 4 A C F 2 G H 2
+ 4 A D F 4 G + 4 A D F 3 G H + 2 A D F 3 H 2 + 2 B 2 F 5 + 2 B 2 F 4 H 2 B 2 F 3 G 2
+ 2 B 2 F 3 G H + 2 B 2 F 3 H 2 4 B 2 F 2 G 2 H 2 B 2 F 2 G H 2 2 B C F 5
+ 4 B C F 4 G + 4 B C F 3 G H + 2 B C F 3 H 2 2 C D F 5 2 D E F 5 ) x 7
+ ( A 2 F 5 2 A 2 F 4 G 4 A 2 F 3 G 2 2 A 2 F 3 G H 7 A 2 F 3 H 2 + 2 A 2 F 2 G 3
+ 4 A 2 F 2 G 2 H 2 A 2 F 2 H 3 + 3 A 2 F G 4 2 A 2 F G 3 H + 15 A 2 F G 2 H 2
8 A 2 G 4 H + 4 A B F 5 + 4 A B F 4 G 4 A B F 3 G 2 8 A B F 3 G H
4 A B F 3 H 2 4 A B F 2 G 3 + 4 A B F 2 G 2 H 12 A B F 2 G H 2 + 12 A B F G 3 H
2 A C F 5 + 4 A C F 4 G + 4 A C F 4 H + 2 A C F 3 G 2 4 A C F 3 G H
+ 2 A C F 3 H 2 8 A C F 2 G 2 H + 4 A D F 4 H + 4 A D F 3 G H + 2 B 2 F 4 G
+ 2 B 2 F 4 H + B 2 F 3 G 2 2 B 2 F 3 G H + B 2 F 3 H 2 4 B 2 F 2 G 2 H
+ 4 B C F 4 H + 4 B C F 3 G H 2 B D F 5 2 C E F 5 D 2 F 5 ) x 6
+ ( 2 A 2 F 5 2 A 2 F 4 G 2 A 2 F 3 G 2 4 A 2 F 3 G H 6 A 2 F 3 H 2
+ 6 A 2 F 2 G 3 + 6 A 2 F 2 G H 2 + 4 A 2 F G 3 H 4 A 2 G 5 + 2 A B F 5
+ 4 A B F 4 G 8 A B F 3 G 2 4 A B F 3 G H 6 A B F 3 H 2 + 6 A B F G 4
+ 4 A C F 4 G + 4 A C F 4 H 4 A C F 3 G H 4 A C F 2 G 3 2 A D F 5
+ 4 A D F 4 H + 2 A D F 3 G 2 + 2 B 2 F 4 G + 2 B 2 F 4 H 2 B 2 F 3 G H
2 B 2 F 2 G 3 + 4 B C F 4 H + 2 B C F 3 G 2 2 B E F 5 2 C D F 5 ) x 5
+ ( 2 A 2 F 4 G 2 A 2 F 4 H + 3 A 2 F 3 G 2 6 A 2 F 3 G H 3 A 2 F 3 H 2
+ 12 A 2 F 2 G 2 H 5 A 2 F G 4 4 A B F 4 G + 4 A B F 4 H 12 A B F 3 G H
+ 8 A B F 2 G 3 + 2 A C F 5 + 4 A C F 4 H 6 A C F 3 G 2 + 4 A D F 4 G
2 A E F 5 + B 2 F 5 + 2 B 2 F 4 H 3 B 2 F 3 G 2 + 4 B C F 4 G
2 B D F 5 C 2 F 5 ) x 4 0 .
These equations admit the straightforward elimination of D and E and then become really terrible. However, they imply the quadratic equation in A:
( 20 F 4 + 48 F 3 G 16 F 3 H 4 F 2 G 2 8 F 2 G H + 4 F 2 H 2 40 F G 3 + 40 F G 2 H 8 G 4 ) A 2
+ ( 30 B F 4 2 B F 3 G + 4 B F 3 H + 54 B F 2 G 2 52 B F 2 G H + 10 B F G 3 ) A
+ 5 B 2 F 4 18 B 2 F 3 G + 16 B 2 F 3 H 3 B 2 F 2 G 2 ,
fortunately, with the nice discriminant
4 ( 5 F 2 + 2 F G 4 F H + G 2 ) 3 B 2 F 2 .
In order to make this discriminant a square, we introduce the new variable Δ by the relation
Δ 2 = 5 F 2 + 2 F G 4 F H + G 2
and eliminate two unknowns:
H = 1 4 Δ 2 5 F 2 2 F G G 2 F
and
B = A 2 · Δ 2 2 Δ F 6 Δ G + 5 F 2 + 14 F G 3 G 2 ( 5 F G 2 Δ ) F
Introducing the new variable
δ : = 5 F + G + 2 Δ
yields the family of curves over the projective space P 3 ( k ) = { ( Δ : δ : A : F ) } , among which the desired two are:
a = A 2 F 2 , b = A 2 Δ 2 + 2 Δ δ 6 F δ δ 2 F 3 δ ,
c = 1 4 A 2 Δ 4 + 8 Δ 3 δ 16 Δ 2 F δ 2 Δ 2 δ 2 32 Δ F δ 2 4 Δ δ 3 + 60 F 2 δ 2 + 16 F δ 3 + δ 4 F 4 δ 2 ,
d = A 2 F 5 δ 2 ( Δ 5 Δ 4 F 8 Δ 3 F δ Δ 3 δ 2 + 12 Δ 2 F 2 δ + 2 Δ 2 F δ 2
+ 24 Δ F 2 δ 2 + 4 Δ F δ 3 40 F 3 δ 2 12 F 2 δ 3 F δ 4 ) .
The desired behavior of Ψ defines a highly reducible surface in P 3 ( k ) , from which we select the needed component
F = 1 2 Δ .
Equation (17) over this component factorizes:
Δ 4 δ 2 y 2 4 A 2 = δ x 2 ( Δ δ ) x + Δ Δ x 2 ( Δ δ ) x + δ Δ δ x 2 ( Δ 2 2 Δ δ δ 2 ) x + Δ δ
Choose the scaling factor in such a way that the equation
y 2 = δ x 2 ( Δ δ ) x + Δ Δ x 2 ( Δ δ ) x + δ Δ δ x 2 ( Δ 2 2 Δ δ δ 2 ) x + Δ δ
holds.
The appropriate behavior of the critical values of Ψ takes place over the hyperbola
Δ δ = 7
over which Equation (31) takes the form (note that the curve is terribly degenerate over F 7 ; for the time being, the authors have no complete explanation).
y 2 = ( δ 2 x 2 + δ 2 x 7 x + 7 ) 7 x 2 + ( δ 2 7 ) x + δ 2 7 δ 2 x 2 + ( δ 4 + 14 δ 2 49 ) x + 7 δ 2
The right-hand side of (33) depends only on δ 2 , and the values we look for are over the conjugated quadratic irrationalities
δ 2 = 7 ± 7 2
Over these points, finally, our two curves are defined by the equation
y 2 = x 2 ( 2 ± 2 ) x 2 1 ( x 2 ± 2 x + 1 2 ) ( x 2 + 1 )
The Belyi functions are not so nice. We present them in the form
4 ( 1 ± 2 ) β = M + N y
with the two recurrent polynomials
M = x 8 ( 2 ± 2 2 ) x 7 + 2 x 6 + ( 6 ± 2 2 ) x 5 ( 2 ± 4 2 ) x 4
+ ( 6 ± 2 2 ) x 3 + 2 x 2 ( 2 ± 2 2 ) x + 1
and
N = x 5 ( 1 ± 2 2 ) x 4 + 2 x 3 + 2 x 2 ( 1 ± 2 2 ) x + 1 .
The alternative form:
N = x 2 ( 2 ± 2 ) x + 1 ( x 2 2 x 1 ) ( x + 1 )
The abscissas of the points in which β = 1 are defined by the equation
( x 2 + 1 ) ( x + 1 ) 2 ( x 2 2 x + 1 ) 2 = 0 .

4. Conclusions

It is not immediately clear that the intensive computer calculation of Belyi pairs with the incredibly complicated answers really provides a better understanding of the relation between combinatorial topology and arithmetic geometry. For example, though we can see some Galois orbits now, the inverse Galois problem is as out of reach as it was forty years ago.
However, some motivation for these calculations can be drawn from the historic perspectives. For example, our understanding of the polynomial equations was preceded by the period, when finding roots meant their explicit expression in terms of the coefficients. A similar attitude to the relations between the dessins and Belyi pairs is dominating now: seeing a dessin, the experts usually want to calculate the corresponding Belyi pair; the ability to understand the underlying arithmetic without such a calculation is in its infancy. Similar parallels can be drawn in calculus, differential equations, etc.
However, living today, we can only dream about the future understanding of the phenomena attracting us—as, maybe, Cardano could dream about knowing the number of roots of any univariate polynomials. Our modest goal is not only to leave some ideas and problems to future generations but also to provide some systematized material. Happily, the computers around us empower the interested mathematicians to reach the results totally impossible by hand calculations.
Complete lists of Belyi pairs of the bounded complexity constitute examples of such material. The results of the present paper correspond to a very low bound (basically ≤ four edges). However, they contain some evidence crying out for a conceptual explanation – e.g., lots of enigmatic coincidences and unpredictable simplifications. The authors hope to improve the current understanding and to present the same results in a clearer form.

Author Contributions

Writing—original draft, G.B.S.; Writing—review & editing, N.M.A. The contributions of the authors are equal. All authors have read and agreed to the published version of the manuscript.

Funding

The work was supported by the Russian Foundation for Basic Research, grant No. 19-29-14234. The second-named author was also supported by the Simons-IUM fellowship.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Tutte, W.T. What is a map? In New Directions in the Theory of Graphs; Harary, F., Ed.; Academic Press: New York, NY, USA, 1973. [Google Scholar]
  2. Harary, F.; Palmer, E.M. Graphical Enumeration; Academic Press: Cambridge, MA, USA, 1973. [Google Scholar]
  3. Bose, S.; Gundry, J.; He, Y.-H. Gauge theories and dessins d’enfants: Beyond the torus. J. High Energy Phys. 2015, 2015, 135. [Google Scholar] [CrossRef]
  4. Asselmeyer-Maluga, T. Quantum computing and the brain: Quantum nets, dessins d’enfants and neural networks. In Proceedings of the Quantum Technology International Conference 2018, Paris, France, 5–7 September 2018; Volume 198, p. 00014. [Google Scholar]
  5. Artin, M.; Jackson, A.; Mumford, D.; Tate, J. Alexandre Grothendieck 1928–2014, Part 1. Not. AMS 2016, 63, 242–255. [Google Scholar]
  6. Belyi, G.V. Galois extensions of a maximal cyclotomic fields. Math. USSR Izv. 1980, 14, 247–256. [Google Scholar] [CrossRef]
  7. Schneps, L. Dessins d’enfants on the Riemann sphere. In The Grothendieck Theory of Dessins d’Enfants; Schneps, L., Ed.; London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1994; Volume 200, pp. 47–78. [Google Scholar]
  8. Musty, M.; Schiavone, S.; Sijsling, J.; Voight, J. A database of Belyi maps. In The Open Book Series 2, Thirteenth Algorithmic Number Theory Symposium; Mathematical Sciences Publishers: Berkeley, CA, USA, 2019. [Google Scholar]
  9. Grothendieck, A. Esquisse d’un Programme, Unpublished manuscript (1984). In Geometric Galois Actions; Lochak, P.; Schneps, L., Translators; London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1997; Volume 242, pp. 5–48. [Google Scholar]
  10. Shabat, G.B.; Voevodsky, V.A. Drawing Curves Over Number Fields. In The Grothendieck Festschrift: Progress in Mathematics; Cartier, P., Illusie, L., Katz, N.M., Laumon, G., Manin, Y.I., Ribet, K.A., Eds.; Birkhäuser: Boston, MA, USA, 1990; Volume 88. [Google Scholar]
  11. Girondo, E.; Gonzalez-Diez, G. Introduction to Compact Riemann Surfaces and Dessins d’Enfants; London Mathematical Society Student Texts; Cambridge University Press: Cambridge, UK, 2012. [Google Scholar]
  12. Lando, S.; Zvonkin, A. Graphs on Surfaces and Their Applications; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
  13. Sijsling, J.; Voight, J. On computing Belyi maps. Publications Mathématiques de Besançon Algèbre et Théorie des Nombres 2014, 1, 73–131. [Google Scholar] [CrossRef] [Green Version]
  14. Shabat, G. Calculating and drawing Belyi pairs. J. Math. Sci. 2017, 226, 667–693. [Google Scholar] [CrossRef]
  15. Adrianov, N.M.; Amburg, N.Y.; Dremov, V.A.; Kochetkov, Y.Y.; Kreines, E.M.; Levitskaya, Y.A.; Nasretdinova, V.F.; Shabat, G.B. Catalog of dessins d’enfants with no more than 4 edges. J. Math. Sci. 2009, 158, 22–80. [Google Scholar] [CrossRef] [Green Version]
  16. Shabat, G.B.; Zvonkin, A.K. Plane trees and algebraic numbers. In Contemporary Mathematics, Proceedings of the “Jerusalem Combinatorics’ 93”, Jerusalem, Israel, 9–17 May 1993; AMS: Jerusalem, Israel, 1994; Volume 176, pp. 233–275. [Google Scholar]
  17. Bétréma, J.; Péré, D.; Zvonkin, A.K. Plane Trees and Their Shabat Polynomials; Rapport Interne du LaBRI: Bordeaux, France, 1992. [Google Scholar]
  18. Kochetkov, Y.Y. Plane trees with nine edges. Catalog. J. Math. Sci. 2009, 158, 114–140. [Google Scholar] [CrossRef]
  19. Kochetkov, Y.Y. Short catalog of plane ten-edge trees. arXiv 2014, arXiv:1412.2472v1. [Google Scholar]
  20. Adrianov, N.M.; Kochetkov, Y.Y.; Suvorov, A.D.; Shabat, G.B. Mathieu groups and plane trees. Fundam. Prikl. Mat. 1995, 1, 377–384. [Google Scholar]
  21. Shabat, G. Unicellular four-edged toric dessins. J. Math. Sci. 2015, 209, 309–318. [Google Scholar] [CrossRef]
  22. Goupil, A.; Schaeffer, G. Factoring N-cycles and counting maps of given genus. Eur. J. Comb. 1998, 19, 819–834. [Google Scholar] [CrossRef] [Green Version]
  23. Dremov, V.A. Is 1 − β a square? Unpublished. 2000. [Google Scholar]
  24. Igusa, J. On Siegel modular forms of genus two. Am. J. Math. 1962, 84, 175–200. [Google Scholar] [CrossRef]
  25. Birch, B. Non-congruence subgroups, covers and drawings. In The Grothendieck Theory of Dessins D’Enfants; London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1994; Volume 200, pp. 25–46. [Google Scholar]
  26. Fuertes, Y.; Mednykh, A. Genus 2 semi-regular coverings with lifting symmetries. Glasg. Math. J. 2008, 50, 379–394. [Google Scholar]
  27. Adrianov, N.M.; Shabat, G.B. Belyi functions of dessins d’enfants of genus 2 with 4 edges. Russ. Math. Surv. 2005, 60, 1237–1239. [Google Scholar] [CrossRef]
  28. Harer, J.; Zagier, D. The Euler characteristic of the moduli space of curves. Invent. Math. 1986, 85, 457–485. [Google Scholar] [CrossRef] [Green Version]
  29. Abel, N.-H. Sur l’intégration de la formule différentielle ρ dz R , R et ρ étant des fonctions entières. J. Reine Angew. Math. 1826, 1, 185–221. [Google Scholar]
  30. Shabat, G. Belyi pairs in the critical filtrations of Hurwitz spaces. In Teichmüller Theory and Grothendieck-Teichmüller Theory; Ji, L., Papadopoulos, A., Su, W., Eds.; Advanced Lectures in Mathematics (ALM); International Press: Somerville, MA, USA, 2022; pp. 320–341. [Google Scholar]
Figure 1. Unicellular dessins of genus 1 with 4 edges.
Figure 1. Unicellular dessins of genus 1 with 4 edges.
Mathematics 10 00258 g001
Figure 2. Octagon pastings of genus 2.
Figure 2. Octagon pastings of genus 2.
Mathematics 10 00258 g002
Figure 3. The dessin Y a b a b .
Figure 3. The dessin Y a b a b .
Mathematics 10 00258 g003
Table 1. Prime divisors of the discriminants and j-invariants of the underlying curves.
Table 1. Prime divisors of the discriminants and j-invariants of the underlying curves.
Dessin“Bad” Primesj-Invariant of the Curve
332 | 8 3 219488 729 = 2 5 19 3 3 6 = 301.080932
422 | 8 a none 1728 = 2 6 3 3
422 | 8 b none 10976 = 2 5 7 3
431 | 8 a 3 207646 6561 = 2 · 47 3 3 8 = 31.648529
431 | 8 b 3 , 7 10647696795116000 1853320108689 = 2 5 5 3 13859 3 3 8 7 10 = 5745.201137
521 | 8 a 2 , 5 , 7 The real root of I 521 , see below
521 | 8 b + 2 , 5 , 7 One of the non-real roots of I 521 , see below
521 | 8 b 2 , 5 , 7 One of the non-real roots of I 521 , see below
611 | 8 a 3 4000 9 = 2 5 5 3 3 2 = 444.444444
611 | 8 b 2 , 3 , 7 One of the roots of I 611 , see below
611 | 8 c 2 , 3 , 7 One of the roots of I 611 , see below
Table 2. Norms of irrational j-invariants.
Table 2. Norms of irrational j-invariants.
Galois OrbitNorm of j-Invariants
{ 521 | 8 a , 521 | 8 b + , 521 | 8 b } 43 3 389 3 919 3 1693 3 2 10 5 14 7 10
{ 611 | 8 b , 611 | 8 c } 11 6 9239 3 2 5 3 4 7 10
Table 3. Gaussian words and automorphism groups.
Table 3. Gaussian words and automorphism groups.
PastingGaussian WordAut
A a b c d a b c d cyclic of order 8
B a b a b c d c d cyclic of order 2
C 1 a b a c b d c d trivial
C 2 a b a c d b c d trivial
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Adrianov, N.M.; Shabat, G.B. Calculating Complete Lists of Belyi Pairs. Mathematics 2022, 10, 258. https://0-doi-org.brum.beds.ac.uk/10.3390/math10020258

AMA Style

Adrianov NM, Shabat GB. Calculating Complete Lists of Belyi Pairs. Mathematics. 2022; 10(2):258. https://0-doi-org.brum.beds.ac.uk/10.3390/math10020258

Chicago/Turabian Style

Adrianov, Nikolai M., and George B. Shabat. 2022. "Calculating Complete Lists of Belyi Pairs" Mathematics 10, no. 2: 258. https://0-doi-org.brum.beds.ac.uk/10.3390/math10020258

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop