Computational methods for finding the character table of a finite group require a stock of reducible characters and techniques for decomposing these characters into irreducible characters. A method for generating reducible characters from a representation of a group is proposed. Several new techniques for computing the irreducible decompositions of a set of characters are given; these techniques extend earlier results of Conway and M. Guy
AbstractWe describe three different methods to compute all those characters of a finite group that h...
In this thesis we study the representation theory of finite groups and more specifically some aspect...
In this thesis we study the representation theory of finite groups and more specifically some aspect...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
A central problem in computational group theory is that of getting the table of ordinary characters ...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
Dixon's algorithm for the computation of character tables faces two problems—it requires the computa...
This book places character theory and its applications to finite groups within the reach of people w...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
This book discusses character theory and its applications to finite groups. The work places the subj...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractLet J be a finite-dimensional nilpotent algebra over a finite field Fq. We formulate a proce...
AbstractWe describe three different methods to compute all those characters of a finite group that h...
In this thesis we study the representation theory of finite groups and more specifically some aspect...
In this thesis we study the representation theory of finite groups and more specifically some aspect...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
A central problem in computational group theory is that of getting the table of ordinary characters ...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
Dixon's algorithm for the computation of character tables faces two problems—it requires the computa...
This book places character theory and its applications to finite groups within the reach of people w...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
This book discusses character theory and its applications to finite groups. The work places the subj...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractLet J be a finite-dimensional nilpotent algebra over a finite field Fq. We formulate a proce...
AbstractWe describe three different methods to compute all those characters of a finite group that h...
In this thesis we study the representation theory of finite groups and more specifically some aspect...
In this thesis we study the representation theory of finite groups and more specifically some aspect...