Add to ORKGAbstract. Let G be a finite group. Let X1(G) be the first column of the ordi-nary character table of G. In this paper, we will show that if X1(G) = X1(Sn), then G ∼ = Sn. As a consequence, we show that Sn is uniquely determined by the structure of the complex group algebra CSn
AbstractThe relationships between the values taken by ordinary characters of symmetric groups are ex...
AbstractLet cd(G) be the set of all irreducible complex characters of a finite group G. In [4], Lewi...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
AbstractLet G be a finite group. Let X1(G) be the first column of the ordinary character table of G....
A class of natural linear characters for the centralizers of elements in the symmetric group is intr...
Since Cayley’s theorem implies that every finite group G is isomorphic to a subgroup of S|G|, unders...
AbstractIf the irreducible characters of the symmetric group are interpreted combinatorially using t...
We determine invariants like the Smith normal form and the deter-minant for certain integral matrice...
Many results show how restrictions on the degrees of the irreducible characters of a finite group G,...
Abstract. Let G be a finite group. Denote by Irr(G) the set of all irreducible complex characters of...
We use Young tableaux and Young symmetrizers to classify the irreducible represen-tations over C of ...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
summary:The character degree graph of a finite group $G$ is the graph whose vertices are the prime d...
AbstractThe theory of characters of wreath products of finite groups is very well known. The basic f...
AbstractIn this note a combinatorial character formula related to the symmetric group is generalized...
AbstractThe relationships between the values taken by ordinary characters of symmetric groups are ex...
AbstractLet cd(G) be the set of all irreducible complex characters of a finite group G. In [4], Lewi...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
AbstractLet G be a finite group. Let X1(G) be the first column of the ordinary character table of G....
A class of natural linear characters for the centralizers of elements in the symmetric group is intr...
Since Cayley’s theorem implies that every finite group G is isomorphic to a subgroup of S|G|, unders...
AbstractIf the irreducible characters of the symmetric group are interpreted combinatorially using t...
We determine invariants like the Smith normal form and the deter-minant for certain integral matrice...
Many results show how restrictions on the degrees of the irreducible characters of a finite group G,...
Abstract. Let G be a finite group. Denote by Irr(G) the set of all irreducible complex characters of...
We use Young tableaux and Young symmetrizers to classify the irreducible represen-tations over C of ...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
summary:The character degree graph of a finite group $G$ is the graph whose vertices are the prime d...
AbstractThe theory of characters of wreath products of finite groups is very well known. The basic f...
AbstractIn this note a combinatorial character formula related to the symmetric group is generalized...
AbstractThe relationships between the values taken by ordinary characters of symmetric groups are ex...
AbstractLet cd(G) be the set of all irreducible complex characters of a finite group G. In [4], Lewi...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...