Linear groups and computation

DOI10.1016/J.EXMATH.2018.07.002MaRDI QIDQ2292421zbMATH OpenOpenAlexFDO

Publication date 3 February 2020

Published in Expositiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.05984

arithmetic groups computational group theory GAP linear groups MAGMA recognition algorithm Tits alternative

Computational methods for problems pertaining to group theory (20-08) Linear algebraic groups over arbitrary fields (20G15) Other matrix groups over fields (20H20)

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. This article is aimed at a broad mathematical audience, and more particularly at users of group-theoretical methods and computer algebra systems.

Review text

The authors and their collaborators have been developing the comparatively new subject of `Computational Group Theory' in the last few years. This paper is a state-of-the-art exposition of the methods and the results. The only thing not covered is Representation theory but it will be of help to many group theorists interested in finite groups or infinite groups of matrices over finitely generated rings and fields. Regarding the contents, we cannot do better than quote from the authors' introduction: ``This article is an exposition of our ongoing project to compute with groups given by a finite set of generating matrices over an (arbitrary) infinite field. We (i) formulate general methodology; (ii) apply (i) to design effective algorithms; (iii) implement the algorithms and demonstrate their practicality. As (ii) and (iii) indicate, an overarching goal is to obtain algorithms that complete in reasonable time for a wide range of inputs. Ideally, the software would replace traditional mathematics by machine computation, simplifying the solution of problems, and leading to the solution of formerly intractable problems. Our methodology draws on (classical) theory of linear groups (as in the texts by Dixon and Wehrfritz). This equips us with well-tried tools, such as the `method of finite approximation'. Apart from underpinning the success of our approach, linear group theory and its central concerns guide our choice of problems to give priority. One of these is realizing the Tits alternative computationally. That is, we devise and implement a practical algorithm to test whether a finitely generated linear group is solvable-by-finite. Then we dispose of further questions for solvable-by-finite linear groups: recognition problems such as testing whether a group is finite, solvable, or nilpotent. Later parts of the article are occupied with the second class of the Tits alternative, specifically arithmetic and Zariski dense subgroups of semisimple algebraic groups. We conclude by discussing avenues for future research.

Recommendations

Cites work

Cited in

(18)

Describes a project that uses

Uses Software

This page was built for publication: Linear groups and computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292421)