Algorithms for matrix groups and the tits alternative

Research output: Contribution to journalConference article

2 Scopus citations

Abstract

Tits has shown that a finitely generated linear group either contains a nonabelian free group or has a solvable subgroup of finite index. This paper gives a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. The complexity of problems relating to linear groups with solvable subgroups of finite index is also investigated.

Original languageEnglish (US)
Pages (from-to)593-602
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1995
Externally publishedYes
EventProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA
Duration: Oct 23 1995Oct 25 1995

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this