Computing the Zariski closure of a finitely generated matrix group
Group Theory
2026-01-12 v2
Abstract
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on non-trivial examples. In the last section we report on an implementation of the algorithm in the computer algebra system {\tt OSCAR}.
Cite
@article{arxiv.2505.02577,
title = {Computing the Zariski closure of a finitely generated matrix group},
author = {Willem A. de Graaf},
journal= {arXiv preprint arXiv:2505.02577},
year = {2026}
}