Hook length inequalities for t-regular partitions in the t-aspect

Abstract

Let t≥2 and k≥1 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 bt,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 bt,k(n) for fixed values of k. We prove that for any t≥2, bt+1,1(n)≥ bt,1(n), for all n≥0. We also prove that b3,2(n)≥ b2,2(n) for all n>3, and b3,3(n)≥ b2,3(n) for all n≥0. Finally, we state some problems for future works.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…