Skip to main content

Research Repository

Advanced Search

All Outputs (3)

Algebra, matrices, and computers (2019)
Journal Article
Detinko, A., Flannery, D., & Hulpke, A. (2019). Algebra, matrices, and computers. Snapshots of modern mathematics from Oberwolfach, 5, 1-12. https://doi.org/10.14760/SNAP-2019-005-EN

What part does algebra play in representing the real world abstractly? How can algebra be used to solve hard mathematical problems with the aid of modern computing technology? We provide answers to these questions that rely on the theory of matrix gr... Read More about Algebra, matrices, and computers.

The strong approximation theorem and computing with linear groups (2019)
Journal Article
Detinko, A. S., Flannery, D. L., & Hulpke, A. (2019). The strong approximation theorem and computing with linear groups. Journal of Algebra, 529, 536-549. https://doi.org/10.1016/j.jalgebra.2019.04.011

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group for . More generally, we are able to com... Read More about The strong approximation theorem and computing with linear groups.

Practical computation with linear groups over infinite domains (2019)
Book Chapter
Detinko, A. S., & Flannery, D. L. (2019). Practical computation with linear groups over infinite domains. In C. Campbell, C. Parker, M. Quick, E. Robertson, & C. Roney-Dougal (Eds.), Groups St Andrews 2017 in Birmingham (261-270). Cambridge: Cambridge University Press. https://doi.org/10.1017/9781108692397.011

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... Read More about Practical computation with linear groups over infinite domains.