IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i2p258-d725384.html
   My bibliography  Save this article

Calculating Complete Lists of Belyi Pairs

Author

Listed:
  • Nikolai M. Adrianov

    (Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991 Moscow, Russia)

  • George B. Shabat

    (Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991 Moscow, Russia
    Department of Mathematics, Logic and Intelligent Systems in Humanities, Russian State University for the Humanities, 125993 Moscow, Russia)

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.

Suggested Citation

  • Nikolai M. Adrianov & George B. Shabat, 2022. "Calculating Complete Lists of Belyi Pairs," Mathematics, MDPI, vol. 10(2), pages 1-25, January.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:2:p:258-:d:725384
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/2/258/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/2/258/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:2:p:258-:d:725384. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.