相关论文: Congruences in character tables of symmetric group…

Let $X$ be a character table of the symmetric group $S_n$. It is shown that unless $n = 4$ or $n=6$, there is a unique way to assign partitions of $n$ to the rows and columns of $X$ so that for all $\lambda$ and $\nu$, $X_{\lambda\nu}$ is…

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…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…

Motivated by recent work of Peluse and Soundararajan on divisibility properties of the entries of the character tables of symmetric groups, we investigate the question: For a finite group G, when are two columns of the character table of G…

Let B be a block of a finite group G with defect group D. We prove that the exponent of the center of D is determined by the character table of G. In particular, we show that D is cyclic if and only if B contains a "large" family of…

We give closed product formulas for the irreducible characters of the symmetric groups related to rectangular `almost square' Young diagrams $p \times(p+\delta)$ for a fixed value of an integer $\delta$ and an arbitrary integer $p$.

By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…

We prove that deciding the vanishing of the character of the symmetric group is $C_=P$-complete. We use this hardness result to prove that the the square of the character is not contained in $\#P$, unless the polynomial hierarchy collapses…

We study asymptotics of an irreducible representation of the symmetric group S_n corresponding to a balanced Young diagram \lambda (a Young diagram with at most C\sqrt{n} rows and columns for some fixed constant C) in the limit as n tends…

Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the limit n\to\infty. We give an explicit combinatorial formula for…

Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…

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 investigate symmetric quotient algebras of symmetric algebras, with an emphasis on finite group algebras over a complete discrete valuation ring ${\mathcal O}$. Using elementary methods, we show that if an ordinary irreducible character…

Let \chi be an irreducible character of the finite group G. If g is an element of G and \chi(g) is not zero, then we conjecture that the order of g divides |G|/\chi(1). The conjecture is a generalization of the classical fact that…

Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

If \chi^\lambda is the irreducible character of the symmetric group S_n corresponding to the partition \lambda of n then we may symmetrize a tensor v_1 \otimes ... \otimes v_n by \chi^\lambda. Gamas's theorem states that the result is not…