We present variants of two of the procedures for analysing matrix representations of groups which form part of the so-called MEATAXE collection of algorithms. Our variants make use of cyclic matrices in both their design and analysis. This leads to simplifications in the procedures, more complete complexity analyses, and potential improvements in practical performance
AbstractWe survey recent work in some components of combinatorial matrix analysis, including qualita...
This book sets out an account of the tools which Frobenius used to discover representation theory fo...
Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic a...
We present variants of two of the procedures for analysing matrix representations of groups which fo...
AbstractLet M(d,F) denote the algebra of d×d matrices over a field F, and denote by mX(t) and cX(t) ...
Let M(d,F) denote the algebra of d×d matrices over a field F, and denote by mx(t) and cx(t) the mini...
The Meataxe algorithm is a popular algorithm to test modules for irreducibility. I review the theory...
AbstractAn element X in the algebra M(n,F) of all n×n matrices over a field F is said to be f-cyclic...
AbstractWe use algorithms developed recently for the study of linear groups to investigate a sequenc...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
We present an algorithm to condense induced modules for a finite group over a finite field. It is bu...
The purpose of this project is to introduce another method of working with groups, that is more effi...
An element X in the algebra M(n,F) of all n × n matrices over a field F is said to be f-cyclic if th...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractWe survey recent work in some components of combinatorial matrix analysis, including qualita...
This book sets out an account of the tools which Frobenius used to discover representation theory fo...
Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic a...
We present variants of two of the procedures for analysing matrix representations of groups which fo...
AbstractLet M(d,F) denote the algebra of d×d matrices over a field F, and denote by mX(t) and cX(t) ...
Let M(d,F) denote the algebra of d×d matrices over a field F, and denote by mx(t) and cx(t) the mini...
The Meataxe algorithm is a popular algorithm to test modules for irreducibility. I review the theory...
AbstractAn element X in the algebra M(n,F) of all n×n matrices over a field F is said to be f-cyclic...
AbstractWe use algorithms developed recently for the study of linear groups to investigate a sequenc...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
We present an algorithm to condense induced modules for a finite group over a finite field. It is bu...
The purpose of this project is to introduce another method of working with groups, that is more effi...
An element X in the algebra M(n,F) of all n × n matrices over a field F is said to be f-cyclic if th...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractWe survey recent work in some components of combinatorial matrix analysis, including qualita...
This book sets out an account of the tools which Frobenius used to discover representation theory fo...
Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic a...