English
Related papers

Related papers: Hook-Length Biases in $t$-regular partitions

200 papers

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…

Combinatorics · Mathematics 2026-03-13 Nayandeep Deka Baruah , Hirakjyoti Das , Pankaj Jyoti Mahanta , Manjil P. Saikia

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…

Combinatorics · Mathematics 2024-05-30 Gurinder Singh , Rupam Barman

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

Combinatorics · Mathematics 2023-08-30 Cristina Ballantine , Hannah Burson , William Craig , Amanda Folsom , Boya Wen

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…

Combinatorics · Mathematics 2024-06-27 Catherine Cossaboom

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…

Combinatorics · Mathematics 2025-11-20 Hongshu Lin , Wenston J. T. Zang

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…

Combinatorics · Mathematics 2025-01-09 Rupam Barman , Pankaj Jyoti Mahanta , Gurinder Singh

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…

Combinatorics · Mathematics 2024-02-09 Tewodros Amdeberhan , George E. Andrews , Ken Ono , Ajit Singh

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…

Combinatorics · Mathematics 2008-07-14 Guo-Niu Han

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…

Combinatorics · Mathematics 2010-11-17 William J. Keith , Rishi Nath

In this article, we study hook lengths in $\ell$-regular partitions and $\ell$-distinct partitions. More precisely, we establish hook length inequalities between $\ell$-regular partitions and $\ell$-distinct partitions for hook lengths $2$…

Combinatorics · Mathematics 2025-04-15 Eunmi Kim

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…

Combinatorics · Mathematics 2026-01-26 Frédéric Jouhet , David Wahiche

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…

Combinatorics · Mathematics 2025-05-01 Hongshu Lin , Wenston J. T. Zang

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…

Combinatorics · Mathematics 2025-06-18 Gurinder Singh , Rupam Barman

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…

Combinatorics · Mathematics 2023-12-15 Joshua Males

In a paper by the author, Hemmer, Hopkins, and Keith the concept of a fixed point in a sequence was applied to the sequence of first column hook lengths of a partition. In this paper we generalize this notion to fixed hook lengths in an…

Combinatorics · Mathematics 2024-06-14 Philip Cuthbertson

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…

Combinatorics · Mathematics 2025-03-18 Hyunsoo Cho , Byungchan Kim , Eunmi Kim , Ae Ja Yee

The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…

Combinatorics · Mathematics 2025-02-18 Chenglang Yang

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…

Combinatorics · Mathematics 2026-02-13 William Craig , Madeline Locus Dawsey , Guo-Niu Han

Motivated by the many roles that hook lengths play in mathematics, we study the distribution of the number of $t$-hooks in the partitions of $n$. We prove that the limiting distribution is normal with mean $\mu_t(n)\sim…

Number Theory · Mathematics 2022-08-24 Michael Griffin , Ken Ono , Wei-Lun Tsai

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

Combinatorics · Mathematics 2025-04-14 Alexander Berkovich , Aritram Dhar
‹ Prev 1 2 3 10 Next ›