Hook Length Biases in $t$-Core Partitions

Nayandeep Deka Baruah, Hirakjyoti Das, Pankaj Jyoti Mahanta, Manjil P. SaikiaarXiv 2026 · DOI · arXiv

TL;DR

This paper extends the emerging field of "hook length biases" to a new class of mathematical objects called $t$-core partitions. The authors establish specific inequalities demonstrating how the counts of hooks of different lengths are biased within these $t$-core partitions, using combinatorial arguments.

What Problem Does This Paper Address?

The study of "hook length biases" investigates how the lengths of "hooks" (a structural feature in combinatorial objects called partitions) are distributed. This research area has recently expanded to various types of partitions, such as odd, distinct, and self-conjugate partitions. This paper addresses the question of whether similar biases exist for $t$-core partitions, which are partitions where no hook length is divisible by a specific integer $t$. The authors aim to understand and quantify these biases for $t$-core partitions, building upon prior work on other partition types.

Methods

The primary method employed in this paper is combinatorial analysis. The authors use the structure of Young diagrams (visual representations of partitions) and the definition of hook lengths to derive their results. They analyze the properties of $t$-core partitions, particularly focusing on the conditions that parts and differences between parts must satisfy to avoid hook lengths divisible by $t$. For instance, they examine how the presence or absence of certain hook types (like 2-hooks or 3-hooks) constrains the structure of $t$-core partitions. They also leverage generating functions and known results about quadratic forms to prove some of their theorems.

Datasets

Not discussed in the paper. The paper focuses on theoretical and combinatorial properties of partitions, rather than empirical analysis on datasets.

Key Insights and Ideas

  • Generalization of Hook Length Biases: The paper successfully extends the concept of hook length biases to $t$-core partitions, a previously unexplored area. This broadens the scope of this emerging research topic.
  • Combinatorial Characterization of $t$-Cores: The authors provide detailed combinatorial conditions that $t$-core partitions must satisfy, based on the types of hooks they can contain. This offers a deeper understanding of their structure.
  • Specific Inequalities for $t$-Cores: The paper establishes concrete inequalities for the number of hooks of certain lengths in $t$-core partitions. For example, they show that for 3-core partitions, the number of 1-hooks is greater than or equal to the number of 2-hooks, which is in turn greater than or equal to the number of 4-hooks ($a_{3,1}(n) \ge a_{3,2}(n) \ge a_{3,4}(n)$).
  • Connection to Quadratic Forms: For certain cases (like 2-cores), the analysis connects to properties of triangular numbers and quadratic forms, hinting at deeper number-theoretic connections.

Key Results

The paper presents several theorems and propositions detailing hook length biases in $t$-core partitions. Some notable results include:

  • Proposition 1.1 & Corollary 1.2: For 2-core partitions, specific formulas are given for the number of hooks of odd lengths ($a_{2,2k+1}(n)$), and a bias is shown for hooks of consecutive odd lengths.
  • Theorem 1.3: For 3-core partitions, the inequality $a_{3,1}(n) \ge a_{3,2}(n) \ge a_{3,4}(n)$ is proven for all $n \ge 0$.
  • Theorem 1.4: For 4-core partitions, the inequality $a_{4,1}(n) \ge a_{4,3}(n)$ is proven for all $n \ge 0$.
  • Conjecture 1.5: Based on numerical exploration, the authors conjecture similar biases for 5-core partitions: $a_{5,1}(n) \ge a_{5,3}(n) \ge a_{5,6}(n)$.
  • Theorem 1.9: It is shown that for $k \in \{1,3\}$, $a_{2,k}(n) \le a_{4,k}(n)$ for all $n > 0$, indicating a bias towards longer hooks in 4-cores compared to 2-cores.

Limitations and Future Work

  • Conjecture for $t=5$: The paper presents a conjecture for 5-core partitions ($a_{5,1}(n) \ge a_{5,3}(n) \ge a_{5,6}(n)$) but does not prove it, suggesting it as a direction for future research.
  • Investigating Specific Cases: The authors note that for $t=4$ and $t=5$, certain hook lengths ($a_{4,2}(n)$ and $a_{5,2}(n), a_{5,4}(n)$) do not always fall neatly between the established biases, suggesting further investigation into these specific cases.
  • Generalization for Arbitrary $t$: While the paper focuses on specific values of $t$ (2, 3, 4, 5), a general theory for arbitrary $t$-core partitions might be a natural extension.
  • Computational Complexity: The combinatorial proofs, while elegant, can become intricate for larger values of $t$. Exploring more efficient or generalizable proof techniques could be beneficial.

Summary updated

Abstract

Recently, the theory of hook length biases has emerged as a prominent research topic. Led by Ballantine, Burson, Craig, Folsom, and Wen [\textit{Res. Math. Sci.}, 2023], hook length biases are being explored for ordinary partitions, odd versus distinct partitions, self-conjugate versus distinct odd partitions. Lately, Singh and Barman [\textit{J. Number Theory}, 2024] opened the door to hook length biases in $\ell$-regular partitions. In this work, we extend the theory of hook length biases to $t$-core partitions. For example, let $a_{t,k}(n)$ denote the number of hooks of length $k$ in all $t$-core partitions of $n$, then we find that $a_{3,1}(n)\ge a_{3,2}(n) \ge a_{3,4}(n)$ and $a_{4,1}(n)\ge a_{4,3}(n)$ for all $n$. The methods employed in this work are mainly combinatorial.
BibTeX
@misc{baruah2026hook,
  author = {Nayandeep Deka Baruah and Hirakjyoti Das and Pankaj Jyoti Mahanta and Manjil P. Saikia},
  title = {{Hook Length Biases in $t$-Core Partitions}},
  year = {2026},
  eprint = {2603.10140},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2603.10140},
}
Figure