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

If $\lambda$ and $\mu$ are two non-empty Young diagrams with the same number of squares, and $\boldsymbol\lambda$ and $\boldsymbol\mu$ are obtained by dividing each square into $d^2$ congruent squares, then the corresponding character value…

We relate the linear asymptotic representation theory of the symmetric groups to its spin counterpart. In particular, we give explicit formulas which express the normalized irreducible spin characters evaluated on a strict partition $\xi$…

An important function attached to a complex simple Lie group $G$ is its asymptotic character $X(\lambda,x)$ (where $\lambda,x$ are real (co)weights of $G$) - the Fourier transform in $x$ of its Duistermaat-Heckman function $DH_\lambda(p)$…

We establish for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$…

We study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…

We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…

We show that the largest character degree of an alternating group $A_n$ with $n\geq 5$ can be bounded in terms of smaller degrees in the sense that \[ b(A_n)^2<\sum_{\psi\in\textrm{Irr}(A_n),\,\psi(1)< b(A_n)}\psi(1)^2, \] where…

The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…

We study the asymptotic behavior of the free cumulants (in the sense of free probability theory of Voiculescu) of Jucys--Murphy elements--or equivalently--of the transition measure associated with a Young diagram. We express these cumulants…

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

Let $G$ be a connected reductive group over the complex numbers and let $T\subset G$ be a maximal torus. For any $t\in T$ of finite order and any irreducible representation $V(\lambda)$ of $G$ of highest weight $\lambda$, we determine the…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas…

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

Let $\mathbf{G}$ be a connected reductive algebraic group over a $p$-adic local field $F$. In this paper we study the asymptotic behaviour of the trace characters $\theta _{\pi}$ evaluated at a regular element $\gamma $ of $\mathbf{G}(F)$…

Amdeberhan recently proposed certain equalities between sums in the character table of symmetric groups. These equalities are between signed column sums in the character table, summing over the rows labeled by partitions in $\Ev$, where…

If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…