Integrality and arithmeticity of solvable linear groups

A. S. Detinko; D. L. Flannery; W. A. de Graaf

doi:10.1016/j.jsc.2014.08.011

Integrality and arithmeticity of solvable linear groups

A. S. Detinko, D. L. Flannery, W. A. de Graaf

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

5 Citations (Scopus)

Abstract

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 linear groups over the rational field. The algorithms have been implemented in Magma.

Original language	English
Pages (from-to)	138–145
Number of pages	8
Journal	Journal of Symbolic Computation
Volume	68
Issue number	Part 1
Early online date	11 Aug 2014
DOIs	https://doi.org/10.1016/j.jsc.2014.08.011
Publication status	Published - 1 May 2015
Externally published	Yes

Access to Document

10.1016/j.jsc.2014.08.011Licence: Unspecified

Cite this

@article{1b9394d971774e818050c6b97d3fc6d4,

title = "Integrality and arithmeticity of solvable linear groups",

abstract = "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 linear groups over the rational field. The algorithms have been implemented in Magma. ",

keywords = "Arithmetic group, Algorithm, Algebraic group, Lattice",

author = "Detinko, {A. S.} and Flannery, {D. L.} and Graaf, {W. A. de}",

year = "2015",

month = may,

day = "1",

doi = "10.1016/j.jsc.2014.08.011",

language = "English",

volume = "68",

pages = "138–145",

journal = "Journal of Symbolic Computation",

issn = "1095-855X",

publisher = "Academic Press",

number = "Part 1",

}

TY - JOUR

T1 - Integrality and arithmeticity of solvable linear groups

AU - Detinko, A. S.

AU - Flannery, D. L.

AU - Graaf, W. A. de

PY - 2015/5/1

Y1 - 2015/5/1

N2 - 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 linear groups over the rational field. The algorithms have been implemented in Magma.

AB - 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 linear groups over the rational field. The algorithms have been implemented in Magma.

KW - Arithmetic group

KW - Algorithm

KW - Algebraic group

KW - Lattice

UR - http://www.scopus.com/inward/record.url?scp=84919351252&partnerID=8YFLogxK

U2 - 10.1016/j.jsc.2014.08.011

DO - 10.1016/j.jsc.2014.08.011

M3 - Article

SN - 1095-855X

VL - 68

SP - 138

EP - 145

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - Part 1

ER -

Integrality and arithmeticity of solvable linear groups

Abstract

Access to Document

Other files and links

Fingerprint

Cite this