2000 character limit reached
Hook length inequalities for $t$-regular partitions in the $t$-aspect
Published 19 Oct 2024 in math.CO and math.NT | (2410.15088v2)
Abstract: 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 partitions of $n$. In this article, we prove some inequalities for $b_{t,k}(n)$ for fixed values of $k$. We prove that for any $t\geq2$, $b_{t+1,1}(n)\geq b_{t,1}(n)$, for all $n\geq0$. We also prove that $b_{3,2}(n)\geq b_{2,2}(n)$ for all $n>3$, and $b_{3,3}(n)\geq b_{2,3}(n)$ for all $n\geq0$. Finally, we state some problems for future works.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.