Algorithms for linear groups of finite ranks

Alla Detinko; Dane Flannery; Eamonn O'Brien

doi:10.1016/j.jalgebra.2013.06.006

Algorithms for linear groups of finite ranks

Alla Detinko, Dane Flannery, Eamonn O'Brien

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

Let G be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of G and a bound on the Prüfer rank of G. This yields in turn an algorithm to decide whether a finitely generated subgroup of G has finite index. The algorithms are implemented in Magma for groups over algebraic number fields.

Original language	English
Pages (from-to)	187–196
Number of pages	10
Journal	Journal of Algebra
Volume	393
Issue number	1
Early online date	16 Jul 2013
DOIs	https://doi.org/10.1016/j.jalgebra.2013.06.006
Publication status	Published - 1 Nov 2013
Externally published	Yes

Access to Document

10.1016/j.jalgebra.2013.06.006Licence: Other

Cite this

@article{514a788f00a7437fa4cd3b04358537bf,

title = "Algorithms for linear groups of finite ranks",

abstract = "Let G be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of G and a bound on the Pr{\"u}fer rank of G. This yields in turn an algorithm to decide whether a finitely generated subgroup of G has finite index. The algorithms are implemented in Magma for groups over algebraic number fields.",

keywords = "Linear group, Solvable group, Algorithm, Pr{\"u}fer rank",

author = "Alla Detinko and Dane Flannery and Eamonn O'Brien",

year = "2013",

month = nov,

day = "1",

doi = "10.1016/j.jalgebra.2013.06.006",

language = "English",

volume = "393",

pages = "187–196",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Algorithms for linear groups of finite ranks

AU - Detinko, Alla

AU - Flannery, Dane

AU - O'Brien, Eamonn

PY - 2013/11/1

Y1 - 2013/11/1

N2 - Let G be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of G and a bound on the Prüfer rank of G. This yields in turn an algorithm to decide whether a finitely generated subgroup of G has finite index. The algorithms are implemented in Magma for groups over algebraic number fields.

AB - Let G be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of G and a bound on the Prüfer rank of G. This yields in turn an algorithm to decide whether a finitely generated subgroup of G has finite index. The algorithms are implemented in Magma for groups over algebraic number fields.

KW - Linear group

KW - Solvable group

KW - Algorithm

KW - Prüfer rank

UR - https://www.scopus.com/pages/publications/84881549334

U2 - 10.1016/j.jalgebra.2013.06.006

DO - 10.1016/j.jalgebra.2013.06.006

M3 - Article

SN - 0021-8693

VL - 393

SP - 187

EP - 196

JO - Journal of Algebra

JF - Journal of Algebra

IS - 1

ER -

Algorithms for linear groups of finite ranks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this