Regularity and Automorphism Groups of Dessins d'Enfants with Uniform Passports
Tatsuya Ohnishi

TL;DR
This paper explores the symmetry and automorphism groups of dessins d'enfants with uniform passports, revealing conditions for regularity and automorphism group triviality depending on passport structure and genus.
Contribution
It provides new criteria for the existence of regular dessins and trivial automorphism groups based on passport configurations and genus, advancing understanding of dessin symmetries.
Findings
A passport of the form [a^p, b^q, n] admits a regular dessin iff gcd(p,q)=1.
Passports of the form [n, b^q, n] with genus ≥ 2 have dessins with trivial automorphism groups.
Several enumeration results for symmetric group elements relevant to automorphism groups.
Abstract
For a smooth algebraic curve defined over a number field, one can associate a bipartite graph known as a dessin d'enfant. In this paper, we investigate the regularity and automorphism groups of dessins d'enfants with uniform passports, that is, those for which the valencies of black vertices, white vertices, and faces are constant, and study how these properties depend on the genus. Although uniformity imposes a high degree of symmetry, such dessins are not necessarily regular. Our main results are as follows: (1) A passport of the form (the tree case) admits a regular dessin if and only if . (2) Every passport of the form of genus at least 2 admits a dessin with a trivial automorphism group. In addition, we obtain several results on uniform passports of genus 0 and 1. We also establish two theorems on the enumeration of elements in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Advanced Algebra and Geometry · Finite Group Theory Research
