Computing Euclidean Belyi maps

IF 0.3 4区数学 Q4 MATHEMATICS Journal De Theorie Des Nombres De Bordeaux Pub Date : 2023-10-10 DOI:10.5802/jtnb.1256

Matthew Radosevich, John Voight

引用次数: 0

Abstract

We exhibit an explicit algorithm to compute three-point branched covers of the complex projective line when the uniformizing triangle group is Euclidean.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

计算欧几里得Belyi地图

给出了一种计算均匀化三角形群为欧几里德时复射影线三点分支覆盖的显式算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Journal De Theorie Des Nombres De Bordeaux MATHEMATICS-

CiteScore

0.60

自引率

0.00%

发文量

期刊介绍： The Journal de Théorie des Nombres de Bordeaux publishes original papers on number theory and related topics (not published elsewhere).

期刊最新文献

Potential diagonalisability of pseudo-Barsotti–Tate representations Computing Euclidean Belyi maps Rational points on symmetric squares of constant algebraic curves over function fields Numbers which are only orders of abelian or nilpotent groups Asymptotic behavior of class groups and cyclotomic Iwasawa theory of elliptic curves