Related papers: Character polynomials for two rows and hook partit…

In a previous paper (joint with Hausel and Rodriguez-Villegas) we gave a conjectural formula for the mixed Hodge polynomials of character varieties with generic semisimple conjugacy classes at punctures and we prove a formula for the…

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups S_n contain all irreducibles as their constituents. Our main result is that they contain representations…

We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions…

We compute the generating function for the characters of the irreducible representations of SU(n) whose associated Young diagrams have only two rows with the same number of boxes. The result is a rational determinantal expression in which…

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

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 identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in…

For any branched double covering of compact Riemann surfaces, we consider the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We restrict the…

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…

Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…

In \cite{[CZ]}, Cohen and Zemel showed that for a partition $\lambda \vdash k$, the dimension of the irreducible representation of $S_{n}$ corresponding to the partition $(n-k,\lambda) \vdash n$ is a polynomial of degree $k$ in $n$, whose…

One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable advance in this direction is due to…

We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…

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…

In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…

The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…

Just as the definition of factorial Schur functions as a ratio of determinants allows one to show that they satisfy a Jacobi-Trudi-type identity and have an explicit combinatorial realisation in terms of semistandard tableaux, so we offer…

We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…