Alla S. Detinko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alla S. Detinko has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Dane L. Flannery
School of Mathematics, Statistics and Applied Mathematics, National University of Ireland Galway, Galway, Ireland
18 shared publications - Alexander Hulpke
Department of Mathematics, Colorado State University, Fort Collins, USA
6 shared publications D. L. Flannery
School of Mathematics, Statistics and Applied Mathematics, National University of Ireland, Galway, Ireland
4 shared publications- E. A. O'Brien
University of Auckland
4 shared publications D.L. Flannery
National University of Ireland, Galway, University Road, Galway, Ireland
3 shared publications- Willem A. de Graaf
Univ Trento, Dept Math, Povo, Trento, Italy
2 shared publications
Latest Publications
- 27 June 2020
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 32 (1) , 88-96
Experimenting with Symplectic Hypergeometric Monodromy Groups
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.
- 27 June 2020
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 32 (1) , 88-96
Experimenting with Symplectic Hypergeometric Monodromy Groups
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.
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 159-173
2-Generation of simple Lie algebras and free dense subgroups of algebraic groups
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 159-173
2-Generation of simple Lie algebras and free dense subgroups of algebraic groups
- 1 December 2019
- Published by Elsevier in Expositiones Mathematicae
- Vol. 37 (4) , 454-484
Linear groups and computation
- 1 December 2019
- Published by Elsevier in Expositiones Mathematicae
- Vol. 37 (4) , 454-484
Linear groups and computation
- 1 July 2019
- Published by Elsevier in Journal of Algebra
- Vol. 529, 536-549
The strong approximation theorem and computing with linear groups
- 1 July 2019
- Published by Elsevier in Journal of Algebra
- Vol. 529, 536-549
The strong approximation theorem and computing with linear groups
- Open Access
2-generation of simple Lie algebras and free dense subgroups of algebraic groups
We construct generating pairs of simple Lie algebras in characteristic zero. We apply this construction to exhibit infinite series of 2-generator Zariski dense subgroups that are free of rank 2 of the simple algebraic groups SL(n, C), Sp(n, C), G_2(C).
Open Access2-generation of simple Lie algebras and free dense subgroups of algebraic groups
We construct generating pairs of simple Lie algebras in characteristic zero. We apply this construction to exhibit infinite series of 2-generator Zariski dense subgroups that are free of rank 2 of the simple algebraic groups SL(n, C), Sp(n, C), G_2(C).
- Open Access
Algorithms for the Tits alternative and related problems
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotent-by-finite, abelian-by-finite, or central-by-finite. Our algorithms have been implemented in MAGMA and are publicly available.
Open AccessAlgorithms for the Tits alternative and related problems
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotent-by-finite, abelian-by-finite, or central-by-finite. Our algorithms have been implemented in MAGMA and are publicly available.
- Open Access
Recognizing finite matrix groups over infinite fields
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field, and uses this copy to investigate the group's structure. Implementations of our algorithms are available in MAGMA.
Open AccessRecognizing finite matrix groups over infinite fields
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field, and uses this copy to investigate the group's structure. Implementations of our algorithms are available in MAGMA.
- Open Access
Practical computation with linear groups over infinite domains
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.
Open AccessPractical computation with linear groups over infinite domains
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.
- Open Access
Algorithms for experimenting with Zariski dense subgroups
We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if $n=2$ then we compute all congruence images only modulo primes. We propose a separate method that works for all $n$ as long as $H$ contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged.Open AccessAlgorithms for experimenting with Zariski dense subgroups
We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if $n=2$ then we compute all congruence images only modulo primes. We propose a separate method that works for all $n$ as long as $H$ contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged. - 11 April 2019
- Published by Cambridge University Press (CUP)
- p. 261-270
Practical Computation with Linear Groups Over Infinite Domains
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.
- 11 April 2019
- Published by Cambridge University Press (CUP)
- p. 261-270
Practical Computation with Linear Groups Over Infinite Domains
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.