Corpus ID: 119697061

Explicit Belyi maps over Q having almost simple primitive monodromy groups

@article{Barth2017ExplicitBM,
  title={Explicit Belyi maps over Q having almost simple primitive monodromy groups},
  author={D. Barth and A. Wenz},
  journal={arXiv: Number Theory},
  year={2017}
}
We present all Belyi maps P^1(C) -> P^1(C) having almost simple primitive monodromy groups (not isomorphic to A_n or S_n) containing rigid and rational generating triples of degree between 50 and 250. This also leads to new polynomials having almost simple Galois groups over Q(t). 
Belyi map for the sporadic group J1
We compute the genus 0 Belyi map for the sporadic Janko group J1 of degree 266 and describe the applied method. This yields explicit polynomials having J1 as a Galois group over K(t), [K:Q] = 7.
An approach for computing families of multi-branch-point covers and applications for symplectic Galois groups
TLDR
This work combines existing deformation and interpolation techniques with recently developed strong tools for the computation of 3-point covers to compute several families of polynomials with symplectic Galois groups, obtaining the first totally real polynOMials with Galois group PSp 6 ( 2 ) . Expand

References

SHOWING 1-4 OF 4 REFERENCES
Explicit Polynomials Having the Higman-Sims Group as Galois Group over Q(t)
We compute explicit polynomials having the sporadic Higman-Sims group HS and its automorphism group Aut(HS) as Galois groups over the rational function field Q(t).
Groups as Galois Groups: An Introduction
Part 1. The Basic Rigidity Criteria: 1. Hilbert's irreducibility theorem 2. Finite Galois extensions of C (x) 3. Descent of base field and the rigidity criterion 4. Covering spaces and theExpand
On the decomposition of rational functions
TLDR
A simplification of an algorithm to calculate a rational function decomposition algorithm, avoiding expensive solutions of linear equations and proving some indecomposability criteria for rational functions. Expand
The Magma Algebra System I: The User Language
TLDR
The MAGMA language is presented, the design principles and theoretical background are outlined, and the constructors for structures, maps, and sets are outlined. Expand