#### Filter Results:

#### Publication Year

2008

2017

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Abstract We develop methods for computing with matrix groups defined over a range of… (More)

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field,… (More)

a r t i c l e i n f o a b s t r a c t We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group G is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of G. We also provide a simple new algorithm for integrality testing of finitely generated solvable-by-finite… (More)

- ‹
- 1
- ›