Hook Length Biases in $t$-Core Partitions

Recently, the theory of hook length biases has emerged as a prominent research topic. Led by Ballantine, Burson, Craig, Folsom, and Wen [$\mathit{\text{Res.}}\mathit{\text{Math.}}\mathit{\text{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 [$\mathit{\text{J.}}\mathit{\text{Number}}\mathit{\text{Theory}}$, 2024] opened the door to hook length biases in $\mathrm{\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.