Tits has shown that a finitely generated matrix group either contains a nonabelian free group or has a solvable subgroup of finite index. We give a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. N
Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups
โ Scribed by Scott H. Murray; E.A. O'Brien
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 282 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In this Letter, the inexact preconditioned conjugateโgradient (CG) algorithm with innerโouter iteration and the blockโToeplitzโmatrixโbased fastโFourierโ transform (FFT) technique are applied to dense matrix equations from the mixed potential integral equation (MPIE) to enhance the comp
## Abstract A general simple algorithm is proposed to determine the average architecture of an acyclic branched polymer macromolecule from its number of branching points, whatever their functionality. The number of branching points can be derived from SEC measurements using a coupling of viscosimet