Experimenting with Symplectic Hypergeometric Monodromy Groups

A. S. Detinko; D. L. Flannery; A. Hulpke

doi:10.1080/10586458.2020.1780516

Experimenting with Symplectic Hypergeometric Monodromy Groups

A. S. Detinko, D. L. Flannery, A. Hulpke

Research output: Contribution to journal › Article › peer-review

1 Citation (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 language	English
Journal	Experimental Mathematics
Early online date	27 Jun 2020
DOIs	https://doi.org/10.1080/10586458.2020.1780516
Publication status	E-pub ahead of print - 27 Jun 2020
Externally published	Yes

Access to Document

10.1080/10586458.2020.1780516Licence: Unspecified

Cite this

@article{5172b5a183e241ae877161ce748084f3,

title = "Experimenting with Symplectic Hypergeometric Monodromy Groups",

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.",

keywords = "Algorithm, Strong approximation, Symplectic group, Zariski density",

author = "Detinko, {A. S.} and Flannery, {D. L.} and A. Hulpke",

year = "2020",

month = jun,

day = "27",

doi = "10.1080/10586458.2020.1780516",

language = "English",

journal = "Experimental Mathematics",

issn = "1058-6458",

publisher = "A K Peters",

}

TY - JOUR

T1 - Experimenting with Symplectic Hypergeometric Monodromy Groups

AU - Detinko, A. S.

AU - Flannery, D. L.

AU - Hulpke, A.

PY - 2020/6/27

Y1 - 2020/6/27

N2 - 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.

AB - 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.

KW - Algorithm

KW - Strong approximation

KW - Symplectic group

KW - Zariski density

UR - http://www.scopus.com/inward/record.url?scp=85087477605&partnerID=8YFLogxK

U2 - 10.1080/10586458.2020.1780516

DO - 10.1080/10586458.2020.1780516

M3 - Article

AN - SCOPUS:85087477605

JO - Experimental Mathematics

JF - Experimental Mathematics

SN - 1058-6458

ER -

Experimenting with Symplectic Hypergeometric Monodromy Groups

Abstract

Access to Document

Other files and links

Fingerprint

Cite this