Computation of Belyi maps with prescribed ramification and applications in Galois theory

@article{Barth2021ComputationOB,
  title={Computation of Belyi maps with prescribed ramification and applications in Galois theory},
  author={D. Barth and A. Wenz},
  journal={Journal of Algebra},
  year={2021},
  volume={569},
  pages={616-642}
}
Abstract We compute genus-0 Belyi maps with prescribed monodromy groups and verify the computed results. Among the computed examples are almost simple primitive groups that satisfy the well known rational rigidity criterion yielding polynomials with prescribed Galois groups over Q ( t ) . We also give an explicit version of a theorem of Magaard, which predicts all sporadic groups occurring as composition factors of monodromy groups of rational functions. 
Covering groups of M22 as regular Galois groups over Q
Abstract We close a gap in the literature by showing that the full covering groups of the Mathieu group M 22 and of its automorphism group Aut ( M 22 ) occur as the Galois groups of Q -regular GaloisExpand
Covering groups of $M_{22}$ as regular Galois groups over $\mathbb{Q}$
We close a gap in the literature by showing that the full covering groups of the Mathieu group M22 and of its automorphism group Aut(M22) occur as the Galois groups of Q-regular Galois extensions ofExpand

References

SHOWING 1-10 OF 32 REFERENCES
Composition factors of monodromy groups
The authors prove the 1990 conjecture of Guralnick and Thompson on composition factors of monodromy groups. Using Riemann's existence theorem, the conjecture translates into a problem on primitiveExpand
On rational functions with monodromy group M11
TLDR
New polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$ are computed, which lead, via specialization, to number fields with very small discriminant or few ramified primes. Expand
On computing Belyi maps
We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomialExpand
Konstruktion von Zahlkörpern mit der Galoisgruppe M11 über $$\mathbb{Q}(\sqrt { - 11} )$$
AbstractAlgebraic function fields and algebraic number fields with the Mathieu group M11 as Galois group over the ground field $$\mathbb{Q}(\sqrt { - 11} )$$ will be constructed.
Numerical calculation of three-point branched covers of the projective line
We exhibit a numerical method to compute three-point branched covers of the complex projective line. We develop algorithms for working explicitly with Fuchsian triangle groups and their finite indexExpand
A Rational Function Decomposition Algorithm by Near-Separated Polynomials
TLDR
An algorithm for decomposing rational functions over an arbitrary coefficient field that requires exponential time, but is more efficient in practice than the previous ones, including the polynomial time algorithm. Expand
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
Convergence of a Variant of the Zipper Algorithm for Conformal Mapping
TLDR
Convergence for Jordan regions in the sense of uniformly close boundaries is proved and corresponding uniform estimates on the closed region and the closed disc for the mapping functions and their inverses are given. Expand
Strongly regular graphs
TLDR
This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics, as well as suggesting ways to improve the quality of these graphs. Expand
Algorithm 756: a MATLAB toolbox for Schwarz-Christoffel mapping
TLDR
The Schwarz- Christoffel Toolbox for MATLAB is a new implementation of Schwarz-Christoffel formulas for maps from the disk, half-plane, strip, and rectangle domains to polygon interiors, and from thedisk to polyagon exteriors. Expand
...
1
2
3
4
...