Computing the Zariski closure of a finitely generated rational matrix group

2025/05/05 by de Graaf, Willem A.
#20G20 #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.2505.02577

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 therefore be used on non-trivial examples.

Citations

• On the Intersection Problem for Quantum Finite Automata
• Polynomial Invariants for Affine Programs

Related

• Algorithm to Compute Orbit Zariski Closure in Affine Plane
• Large Galois groups with applications to Zariski density
• Infinitesimal Zariski closures of positive representations
• Algebraic Geometry and Representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
• Variations on the theme of Zariski's Cancellation Problem