Experimenting with symplectic hypergeometric monodromy groups
Group Theory
2020-06-09 v2
Abstract
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by extending our previous algorithms for Zariski dense groups, based on the strong approximation and congruence subgroup properties.
Cite
@article{arxiv.1905.02190,
title = {Experimenting with symplectic hypergeometric monodromy groups},
author = {A. S. Detinko and D. L. Flannery and A. Hulpke},
journal= {arXiv preprint arXiv:1905.02190},
year = {2020}
}