Related papers: Partitions with fixed largest hook length

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

We link the theory of optimal transportation to the theory of integer partitions. Let $\mathscr P(n)$ denote the set of integer partitions of $n \in \mathbb N$ and write partitions $\pi \in \mathscr P(n)$ as $(n_1, \dots, n_{k(\pi)})$.…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

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…

The Alder-Andrews Theorem, a partition inequality generalizing Euler's partition identity, the first Rogers-Ramanujan identity, and a theorem of Schur to $d$-distinct partitions of $n$, was proved successively by Andrews in 1971, Yee in…

Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…

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…

In this paper, we count the total number of hooks of length two in all odd partitions of $n$ and all distinct partitions of $n$ with a bound on the largest part of the partitions. We generalize inequalities of Ballantine, Burson, Craig,…

In the first three papers, we conducted a series of discussions on the statistics of strict partitions and Rogers-Ramanujan partitions, specifically the sequences of odd length (denoted as $\mathrm{sol}$) and its extensions. We established…

Let $\lambda$ be a partition, viewed as a Young diagram. We define the hook difference of a cell of $\lambda$ to be the difference of its leg and arm lengths. Define $h_{1,1}(\lambda)$ to be the number of cells of $\lambda$ with hook…

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

Fix $t \geq 2$. We first give an asymptotic formula for certain sums of the number of $t$-cores. We then use this result to compute the distribution of the size of the $t$-core of a uniformly random partition of an integer $n$. We show that…

Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

Motivated by recent study on the number of $t$-hooks in partitions arising from Euler's partition identity, we investigate the number of $t$-hooks in the sets from the first Rogers-Ramanujan identity and the first little G\"ollitz identity.…

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…

Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…