Experimenting with Symplectic Hypergeometric Monodromy Groups

DOI10.1080/10586458.2020.1780516zbMath1528.20088arXiv1905.02190OpenAlexW3037713556MaRDI QIDQ6042965

Dane L. Flannery, Alla S. Detinko, Alexander Hulpke

Publication date: 4 May 2023

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.02190

zbMATH Keywords

symplectic groupsstrong approximationZariski densityhypergeometric monodromy groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over arbitrary fields (20G15) Other matrix groups over rings (20H25) Computational methods for problems pertaining to group theory (20-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperbolic monodromy groups for the hypergeometric equation and Cartan involutions.
• Algorithms for arithmetic groups with the congruence subgroup property.
• Integrality and arithmeticity of solvable linear groups.
• Arithmeticity of some hypergeometric monodromy groups in Sp(4)
• Monodromy for the hypergeometric function \(_ nF_{n-1}\)
• Subgroup growth.
• The strong approximation theorem and computing with linear groups
• Arithmeticity of certain symplectic hypergeometric groups
• Symplectic hypergeometric groups of degree six
• Notes on Thin Matrix Groups
• Arithmeticity of Four Hypergeometric Monodromy Groups Associated to Calabi–Yau Threefolds: Table 1.
• Monodromy of Picard-Fuchs differential equations for Calabi-Yau threefolds
• Fast Management of Permutation Groups I
• Zariski density and computing in arithmetic groups
• Constructive Membership Tests in Some Infinite Matrix Groups
• Thin monodromy in Sp(4)
• SOME MONODROMY GROUPS OF FINITE INDEX IN
• Algorithms for Experimenting with Zariski Dense Subgroups

This page was built for publication: Experimenting with Symplectic Hypergeometric Monodromy Groups