Existing algorithms have only limited ability to answer structural questions about subgroups G of GL(d, F), where F is a finite field. We discuss new and promis-ing algorithmic approaches, both theoretical and practical, which as a first step construct a chief series for G.
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
We describe an algorithm which seeks to decide whether or not a matrix group defined over a finite f...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
Let R be the ring of integers or a number field. We present several algorithms for working with poly...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034651 / BLDSC - British Library D...
AbstractWe provide a new, practical algorithm for deciding finiteness of matrix groups over function...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
Let S be any finite subset GLn(F(t)) where F is a field. In this paper we give algorithms to decide ...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractIn this paper we describe a suite of new algorithms for studying polycyclic matrix groups—al...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
The study of finite groups has been the subject of much research, with substantial success in the 20...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
We describe an algorithm which seeks to decide whether or not a matrix group defined over a finite f...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
Let R be the ring of integers or a number field. We present several algorithms for working with poly...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034651 / BLDSC - British Library D...
AbstractWe provide a new, practical algorithm for deciding finiteness of matrix groups over function...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
Let S be any finite subset GLn(F(t)) where F is a field. In this paper we give algorithms to decide ...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractIn this paper we describe a suite of new algorithms for studying polycyclic matrix groups—al...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
The study of finite groups has been the subject of much research, with substantial success in the 20...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
We describe an algorithm which seeks to decide whether or not a matrix group defined over a finite f...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...