On the existence of covers of \(\mathbb{P}_1\) associated to certain permutations
type: Item
instance of: scholarly article
title: On the existence of covers of \(\mathbb{P}_1\) associated to certain permutations
zbMATH Open document ID: 1391.14064
DOI: 10.4171/RLM/805
author: Pietro Corvaja
author: Umberto Zannier
published in: Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni
publication date: 2018-07-02T00:00:00Z
review text: Let \(S\) be a closed Riemann surface, of genus \(g\), and let \(\delta:S \to \widehat{\mathbb C}\) be a non-constant holomorphic map, of degree \(d \geq 2\), whose branch values are contained in the set \(\{\infty,0,1\}\). In this case, \(S\) is called a Belyi curve and \(\delta\) a Belyi map. Associated to \(\delta\) is a transitive subgroup of the permutation group \({\mathscr S}_{d}\), generated by three permutations \(\sigma_{0}, \sigma_{1}, \sigma_{\infty}\) satisfying the relation \(\sigma_{0}\sigma_{1}\sigma_{\infty}=1\). These permutations are obtained as follows. The \(\delta\)-preimage of the closed interval \([0,1]\) induces a bipartite graph on \(S\) (the points in \(\delta^{-1}(0)\) are the black vertices and those in \(\delta^{-1}(1)\) the white ones) producing a \(2\)-cell decomposition of it (a dessin d'enfant as introduced by Grothendieck). Make a labelling of the \(d\) edges using numbers in \(\{1,\ldots,d\}\). The permutation \(\sigma_{0}\) (respectively, \(\sigma_{1}\)) is obtained as the product of the cycles of the edges following the counter-clockwise orientation at each of the black (respectively, white) vertices. The cycle structure of each of the three permutations is encoded by the tuple \((a_{1},\ldots,a_{\alpha};b_{1},\ldots,b_{\beta};c_{1},\ldots,c_{\gamma})\), called the passport of \(\delta\), where \(\alpha\) (respectively, \(\beta\) and \(\gamma\)) denotes the number of cycles of \(\sigma_{0}\) (respectively, \(\sigma_{1}\) and \(\sigma_{\infty}\)) and \(a_{j}\) (respectively, \(b_{i}\) and \(c_{k}\)) are the length of its cycles. It holds that \(a_{1}+\cdots+a_{\alpha}=b_{1}+\cdots+b_{\beta}=c_{1}+\cdots+c_{\gamma}=d\) and, by the Euler formula, that \(2-2g=\alpha+\beta+\gamma-d\). Now, one may consider any tuple \((a_{1},\ldots,a_{\alpha};b_{1},\ldots,b_{\beta};c_{1},\ldots,c_{\gamma})\) of integers \(a_{j},b_{i},c_{k} \geq 1\), satisfying \(a_{1}+\cdots+a_{\alpha}=b_{1}+\cdots+b_{\beta}=c_{1}+\cdots+c_{\gamma}=d\), and to ask if…
reviewed by: Rubén A. Hidalgo
Mathematics Subject Classification ID: 14H57
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05E99
zbMATH DE Number: 6898068
zbMATH Keywords: permutations
zbMATH Keywords: covers (of curves)
zbMATH Keywords: branching
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.4171/rlm/805
OpenAlex ID: W2800588558
description: scientific article; zbMATH DE number 6898068