EUVIMEDEUVIMED entdecken
Crossref

Computing the Zariski closure of a finitely generated matrix group

Willem de Graaf

Mathematics of Computation · 25.06.2026

DOI: 10.1090/mcom/4244 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 25.06.2026. Verfasst von Willem de Graaf. Die Arbeit nennt 22 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We describe an algorithm for determining the algebraic subgroup of G L ( n , C ) \mathrm {GL}(n,\mathbb {C}) that is defined as the closure of the group generated by a finite number of elements of G L ( n , C ) \mathrm {GL}(n,\mathbb {C}) . The algorithm avoids the use of Gröbner bases and can be used on nontrivial examples. In the last section we report on an implementation of the algorithm in the computer algebra system OSCAR .

Zitieren

APA

Graaf, W. D. (2026). Computing the Zariski closure of a finitely generated matrix group. Mathematics of Computation. https://doi.org/10.1090/mcom/4244

Vancouver

Graaf WD. Computing the Zariski closure of a finitely generated matrix group. Mathematics of Computation. 2026. doi:10.1090/mcom/4244

BibTeX
@article{Graaf2026,
  author = {Graaf, Willem de},
  title = {Computing the Zariski closure of a finitely generated matrix group},
  journal = {Mathematics of Computation},
  year = {2026},
  doi = {10.1090/mcom/4244}
}
Kostenlos starten →