相关论文: Asymptotics of characters of symmetric groups rela…

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

In this paper we study quantitative aspects of trace characters $\Theta_\pi$ of reductive $p$-adic groups when the representation $\pi$ varies. Our approach is based on the local constancy of characters and we survey some other related…

We will describe the relationship between the indecomposable characters of the finitary symmetric group and its ergodic invariant random subgroups; and we will interpret each Thoma character as an asymptotic limit of a naturally associated…

Given a generator set $S$ of the symmetric group ${\rm{Sym}}_n$, every permutation $\pi\in {\rm{Sym}_n}$ is a word (product of elements) of $S$. A positive integer $d(\pi)$ is associated with each $\pi\in{\rm{Sym}_n}$ taking the length of…

Jack characters are a one-parameter deformation of the characters of the symmetric groups; a deformation given by the coefficients in the expansion of Jack symmetric functions in the basis of power-sum symmetric functions. We study Jack…

We define eventually symmetric functions to be those power series of bounded degree in infinitely many variables that are invariant under interchanging all the variables with large enough indices. We show how this ring $\tilde{\Lambda}$ is…

We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…

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…

We consider random character values X(g) of the symmetric group on n symbols, where X is chosen at random from the set of irreducible characters and g is chosen at random from the group, and we show that X(g)=0 with probability tending to…

The characters $\chi(\pi)$ of $S_n$ that depend only on the number of cycles of $\pi$ are completely determined.

We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…

For an arbitrary prime $p$ we prove that the proportion of entries divisible by $p$ in certain columns of the character table of the symmetric group $S_n$ tends to 1 as $n\to\infty$. This is done by finding lower bounds on the number of…

The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric…

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…

In this paper we study the complex representations of reductive groups over local non-Archimedean fields. We use the building of the reductive group to give upper-bounds for the absolute value of the character of an admissible…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

In a recent paper, the authors introduced a new basis of the ring of symmetric functions which evaluate to the irreducible characters of the symmetric group at roots of unity. The structure coefficients for this new basis are the stable…

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…