Deciding finiteness of matrix groups in positive characteristic

A. S. Detinko, D. L. Flannery, E. A. O'Brien

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

3 Citations (Scopus)

Abstract

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness problem for finitely generated matrix groups over a field. We also give an algorithm to compute the order of a finite matrix group over a function field of positive characteristic by constructing an isomorphic copy of the group over a finite field. Our implementations of these algorithms are publicly available in Magma.

Original languageEnglish
Pages (from-to)4151-4160
Number of pages10
JournalJournal of Algebra
Volume322
Issue number11
DOIs
Publication statusPublished - 1 Dec 2009

Keywords

  • Algorithm
  • Finiteness problem
  • Function field
  • Matrix group
  • Order problem

Fingerprint

Dive into the research topics of 'Deciding finiteness of matrix groups in positive characteristic'. Together they form a unique fingerprint.

Cite this