AbstractTwo character tables of finite groups are isomorphic if there exist a bijection for the irreducible characters and a bijection for the conjugacy classes that preserve all the character values. We give necessary and sufficient conditions for two finite groups to have isomorphic character tables. In the case of finite p-groups with derived subgroup of order p, we show that the character tables can be classified by equivalence classes of certain homomorphisms of abelian p-groups
This book places character theory and its applications to finite groups within the reach of people w...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractTwo character tables of finite groups are isomorphic if there exist a bijection for the irre...
AbstractTwo character tables of finite groups are isomorphic if there exist a bijection for the irre...
The character table of a finite group G gives a lot of information about the group, though in genera...
Let G and Q be groups with isomorphic tables of marks, and for each subgroup H of G, let H ′ denote ...
The theory of characters of wreath products of finite groups is very well known. The basic fact is t...
The theory of characters of wreath products of finite groups is very well known. The basic fact is t...
AbstractThe theory of characters of wreath products of finite groups is very well known. The basic f...
Let G and H be finite groups. It is proves that any ring isomorphism between character rings of G an...
A new method for the "complete" construction of the character tables of all the finite point groups ...
Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines wh...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We investigate the problem of finding a set of prime divisors of the order of a finite group, such t...
This book places character theory and its applications to finite groups within the reach of people w...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
AbstractTwo character tables of finite groups are isomorphic if there exist a bijection for the irre...
AbstractTwo character tables of finite groups are isomorphic if there exist a bijection for the irre...
The character table of a finite group G gives a lot of information about the group, though in genera...
Let G and Q be groups with isomorphic tables of marks, and for each subgroup H of G, let H ′ denote ...
The theory of characters of wreath products of finite groups is very well known. The basic fact is t...
The theory of characters of wreath products of finite groups is very well known. The basic fact is t...
AbstractThe theory of characters of wreath products of finite groups is very well known. The basic f...
Let G and H be finite groups. It is proves that any ring isomorphism between character rings of G an...
A new method for the "complete" construction of the character tables of all the finite point groups ...
Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines wh...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We investigate the problem of finding a set of prime divisors of the order of a finite group, such t...
This book places character theory and its applications to finite groups within the reach of people w...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...