Skip to main navigation Skip to search Skip to main content

Experimenting with Symplectic Hypergeometric Monodromy Groups

  • University of Hull
  • Colorado State University

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)88-96
Number of pages9
JournalExperimental Mathematics
Volume32
Issue number1
DOIs
Publication statusPublished - 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