Related papers: Plethysm and a character embedding problem of Mill…

We give an explicit description of character sheaves for the symmetric pairs associated to inner involutions of the special linear groups. We make use of the general strategy given in [VX1] and central character consideration. We also…

We define a new relation between character triples and prove some Clifford theory properties for weights in terms of character triples.

We provide a purely local computation of the (elliptic) twisted (by "transpose-inverse") character of the representation \pi=I(\1) of PGL(3) over a p-adic field induced from the trivial representation of the maximal parabolic subgroup. This…

In this paper we prove a character formula expressing the classes of simple representations in the principal block of a simply-connected semisimple algebraic group G in terms of baby Verma modules, under the assumption that the…

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…

I demonstrate how certain identities for Macdonald's polynomials established by Garsia, Haiman and Tesler, together with the conjecture of Hausel, Letellier and Villegas imply explicit relations between mixed Hodge polynomials of different…

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…

An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some…

We use intermediate symplectic characters to give a proof and variations of Hopkins' conjecture, now proved by Hopkins and Lai, on the number of shifted plane partitions of shifted double staircase shape with bounded entries. In fact, we…

The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…

Using the character expansion method, we generalize several well-known integrals over the unitary group to the case where general complex matrices appear in the integrand. These integrals are of interest in the theory of random matrices and…

We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.

The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…

Given natural numbers m and n, we define a deflation map from the characters of the symmetric group S_{mn} to the characters of S_n. This map is obtained by first restricting a character of S_{mn} to the wreath product S_m \wr S_n, and then…

We give formulae relating the value of an irreducible character of a classical group at a matrix to entries of powers of the matrix. This yields a far-reaching generalization of a result of J. L. Cisneros-Molina concerning the $GL_2$ case.

Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in the complexity class #P. Whether this holds more generally is…

We show that almost every entry in the character table of $S_n$ is even as $n\to\infty$. This resolves a conjecture of Miller. We similarly prove that almost every entry in the character table of $S_n$ is zero modulo $3,5,7,11,$ and $13$ as…

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…

The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map…

We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…