On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices

Résumé

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel and Koiran, but the termination argument for their algorithm appears not to yield any complexity bound. In this paper we follow a different approach and obtain a bound on the degree of the polynomials that define the closure. Our bound shows that the closure can be computed in elementary time. We describe several applications of this result, e.g., concerning quantum automata and quantum universal gates. We also obtain an upper bound on the length of a strictly increasing chain of linear algebraic groups, all of which are generated over a fixed number field.

Dates et versions

hal-03450297 , version 1 (25-11-2021)

Identifiants

Citer

Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell. On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. Proceedings of ISSAC 2022, 2022, Villeneuve-d’Ascq, France. ⟨10.1145/3476446.3536172⟩. ⟨hal-03450297⟩
73 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More