Related papers: Irreducible Characters for the Symmetric Groups an…

The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…

A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…

We give a new (inductive) proof of the classical Frobenius--Young correspondence between irreducible complex representations of the symmetric group and Young diagrams, using the new approach, suggested in \cite{OV, VO}, to determining this…

We give new evidences to the fact that the structure of a solvable group can be controlled by irreducible monomial characters. In particular we inspect the role of monomial characters in Isaacs-Navarro-Wolf's conjecture and in Gluck's…

Let $G$ be a finite symmetric, general linear, or general unitary group defined over a field of characteristic coprime to $3$. We construct a canonical correspondence between irreducible characters of degree coprime to $3$ of $G$ and those…

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…

We give a new formula for the irreducible spin characters of the symmetric groups. This formula is analogous to Stanley's character formula for the usual (linear) characters of the symmetric groups.

This paper studies irreducible characters of the $q$-rook monoid algebra $R_n(q)$ using the vertex algebraic method. Based on the Frobenius formula for $R_n(q)$, a new iterative character formula is derived with the help of the vertex…

Suppose that $\chi_\lambda$ and $\chi_\mu$ are distinct irreducible characters of the symmetric group $S_n$. We give an algorithm that, in time polynomial in $n$, constructs $\pi\in S_n$ such that $\chi_\lambda(\pi)$ is provably different…

For any set representation (permutation representation) of the symmetric group $S_n$, we give combinatorial interpretation for coefficients of its Frobenius character expanded in the basis of monomial symmetric functions.

The paper studies how to compute irreducible characters of the generalized symmetric group $C_k\wr{S}_n$ by iterative algorithms. After reproving the Ariki-Koike version of the Murnaghan-Nakayama rule by vertex algebraic methods, we…

Using combinatorics and character theory, we determine the imprimitive faithful complex characters, i.e., the irreducible faithful complex characters which are induced from proper subgroups, of the Schur covers of the symmetric and…

We consider the problem of determining the relationship between two representations knowing that some tensor or symmetric power of the original represetations coincide. Combined with refinements of strong multiplicity one, we show that if…

In math.CO/0109093 the author obtained a formula for the value of an irreducible symmetric group character indexed by a partition of rectangular shape. In the present paper this formula is (conjecturally) generalized to arbitrary shapes.

We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.

Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…

R. Stanley has found a nice combinatorial formula for characters of irreducible representations of the symmetric group of rectangular shape. Then, he has given a conjectural generalisation for any shape. Here, we will prove this formula…

We classify all irreducible admissible representations of three Olshanski pairs connected to the infinite symmetric group. In particular, our methods yield two simple proofs of the classical Thoma's description of the characters of the…

A character of a group is said to be super-monomial if every primitive character inducing it is linear. It is conjectured by Isaacs that every irreducible character of an odd $M$-group is super-monomial. We show that all non linear…