相关论文: On the Number of 2-Hooks and 3-Hooks of Integer Pa…

Let $b_{n,k}$ denote the number of hooks of length $k$ in all the $t$-regular partitions of $n$. Singh and Barman raised the question of finding the relation between $b_{t,2}(n)$ and $b_{t,1}(n)$. Kim showed that there exists $N$ such that…

Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer $n$ has a Young diagram representation. To each…

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…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Recently, Griffin, Ono, and Tsai examined the distribution of the number of $t$-hooks in partitions of $n$, which was later followed by the work of Craig, Ono, and Singh on the distribution of the number of $t$-hooks in self-conjugate…

Let $b_{t,i}(n)$ denote the total number of $i$-hooks in $t$-regular partitions of $n$. Singh and Barman conjectured that $b_{t+1,2}(n) \geq b_{t,2}(n)$ holds for all $t\ge 3$ and $n\ge 0$. This conjecture was known to hold for $t=3$ due to…

Let $b_{t,i}(n)$ denote the total number of the $i$ hooks in the $t$-regular partitions of $n$. Singh and Barman (J. Number Theory { 264} (2024), 41--58) raised two conjectures on $b_{t,i}(n)$. The first conjecture is on the positivity of…

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.…

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$,…

We confirm the speculation that the distribution of $t$-hooks among unrestricted integer partitions essentially descends to self-conjugate partitions. Namely, we prove that the number of hooks of length $t$ among the size $n$ self-conjugate…

Partitions, the partition function $p(n)$, and the hook lengths of their Ferrers-Young diagrams are important objects in combinatorics, number theory and representation theory. For positive integers $n$ and $t$, we study $p_t^e(n)$ (resp.…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…

An integer partition of a positive integer $n$ is called to be $t$-core if none of its hook lengths are divisible by $t$. Recently, Gireesh, Ray and Shivashankar [`A new analogue of $t$-core partitions', \textit{Acta Arith.} \textbf{199}…

A partition of a positive integer $n$ is said to be $t$-core if none of its hook lengths are divisible by $t$. Recently, two analogues, $\overline{a}_t(n)$ and $\overline{b}_t(n)$, of the $t$-core partition function, $c_t(n)$, have been…

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…

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…

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…