2022
DOI: 10.3390/math10020258
|View full text |Cite
|
Sign up to set email alerts
|

Calculating Complete Lists of Belyi Pairs

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) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…A simpler example is the representation of a representation of a finite number of finite graphs justified by a computer calculation, and the assertion that these graphs exhaust all possibilities for the realization of certain conditions (cf. [49]).…”
Section: Visualization In a Mathematical Experiments And Mathematical...mentioning
confidence: 99%
“…A simpler example is the representation of a representation of a finite number of finite graphs justified by a computer calculation, and the assertion that these graphs exhaust all possibilities for the realization of certain conditions (cf. [49]).…”
Section: Visualization In a Mathematical Experiments And Mathematical...mentioning
confidence: 99%
“…Systematic cataloging of Belyi maps is an active research undertaking [MSSV19,AS22]. Contributing to this venture, this article considers comprehensively Belyi maps φ : P 1 → P 1 of the form φ(x) = (1 − x) p (1 − λx) q G m (x) r (1.1)…”
Section: Introductionmentioning
confidence: 99%