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 earlier algorithms for Zariski dense groups, based on the strong approximation and congruence subgroup properties.
| Original language | English |
|---|---|
| Pages (from-to) | 88-96 |
| Number of pages | 9 |
| Journal | Experimental Mathematics |
| Volume | 32 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2023 |
Keywords
- Symplectic group
- Zariski density
- algorithm
- strong approximation
Fingerprint
Dive into the research topics of 'Experimenting with Symplectic Hypergeometric Monodromy Groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver