Linear groups and computation

Alla Detinko; Dane Flannery

doi:10.1016/j.exmath.2018.07.002

Linear groups and computation

Alla Detinko, Dane Flannery

School of Computer Science

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

1 Citation (Scopus)

5 Downloads (Pure)

Abstract

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed.

Original language	English
Pages (from-to)	454-484
Number of pages	31
Journal	Expositiones Mathematicae
Volume	37
Issue number	4
Early online date	29 Jul 2018
DOIs	https://doi.org/10.1016/j.exmath.2018.07.002
Publication status	Published - Dec 2019

Keywords

Matrix group
Algorithm
Computation
Decidable problem

Access to Document

10.1016/j.exmath.2018.07.002

Detinko_2018_EM_computation_AAM
© 2018 Elsevier GmbH. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1016/j.exmath.2018.07.002
Accepted author manuscript, 371 KBLicence: CC BY-NC-ND

https://arxiv.org/abs/1805.05984

Cite this

@article{4c8fc50d6c1444fea17b2952d0e645b8,

title = "Linear groups and computation",

abstract = "We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed.",

keywords = "Matrix group, Algorithm, Computation, Decidable problem",

author = "Alla Detinko and Dane Flannery",

note = "Funding: A. S. Detinko is supported by a Marie Sk{\l}odowska-Curie Individual Fellowship grant (Horizon 2020, EU Framework Programme for Research and Innovation).",

year = "2019",

month = dec,

doi = "10.1016/j.exmath.2018.07.002",

language = "English",

volume = "37",

pages = "454--484",

journal = "Expositiones Mathematicae",

issn = "0723-0869",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Linear groups and computation

AU - Detinko, Alla

AU - Flannery, Dane

N1 - Funding: A. S. Detinko is supported by a Marie Skłodowska-Curie Individual Fellowship grant (Horizon 2020, EU Framework Programme for Research and Innovation).

PY - 2019/12

Y1 - 2019/12

N2 - We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed.

AB - We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed.

KW - Matrix group

KW - Algorithm

KW - Computation

KW - Decidable problem

U2 - 10.1016/j.exmath.2018.07.002

DO - 10.1016/j.exmath.2018.07.002

M3 - Article

SN - 0723-0869

VL - 37

SP - 454

EP - 484

JO - Expositiones Mathematicae

JF - Expositiones Mathematicae

IS - 4

ER -

Linear groups and computation

Abstract

Keywords

Access to Document

Fingerprint

Cite this