Related papers: Coincidences between characters to hooks and 2-par…

Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…

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…

In this article, we study hook lengths of ordinary partitions and $t$-regular partitions. We establish hook length biases for the ordinary partitions and motivated by them we find a few interesting hook length biases in $2$-regular…

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 provide a simple and general construction of infinite families of consistent, modular-covariant pairs of characters satisfying the basic requirements to describe two-character RCFT. These correspond to solutions of generic second-order…

Recent work of Garvan, Sellers, Smoot, and others has made connections between infinite families of congruences for various partition functions. Here, we apply this approach to families of congruences for PED and POD partitions and find…

Robinson showed that the character degrees are determined by knowing, for all $n$, the number of ways that the identity can be expressed as a product of $n$ commutators. Earlier, Strunkov showed that the existence of characters of…

In a recent paper, Bringmann, Craig, Ono, and the author showed that the number of $t$-hooks ($t\geq2$) among all partitions of $n$ is not always asymptotically equidistributed on congruence classes $a \pmod{b}$. In this short note, we…

Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally found by Regev.

Let $ped(n)$ denote the number of partitions of $n$ wherein even parts are distinct (and odd parts are unrestricted). We show infinite families of congruences for $ped(n)$ modulo $8$. We also examine the behavior of $ped_{-2}(n)$ modulo $8$…

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…

The dimension of an irreducible representation of $GL(n,\mathbb{C})$, $Sp(2n)$, or $SO(n)$ is given by the respective hook-length and content formulas for the corresponding partition. The first author, inspired by the Nekrasov-Okounkov…

Recently, there has been a lot of work on combinatorial inequalities related to hook-lengths in $t$-regular partitions. In this short note, we give a proof using generating functions for a result proved by Singh and Barman (2026) using…