Hook-Length Biases in $t$-regular partitions

Read full text
Authors: Manjil P. Saikia, Talukdar, Prabal
Cited by: 0

Abstract

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 combinatorial methods. In addition, we give an alternate proof of another result of Singh \& Barman (2024) which yields as a corollary a previously unobserved connection of hook-lengths in $t$-regular partitions with certain distinct parts partitions.

Fields of Study & Subjects

Advanced Combinatorial Mathematics Advanced Mathematical Identities Analytic Number Theory Research

Publication details

Journal / source
arXiv (Cornell University)
Publication date
9 January 2026
Document type
Preprint