On the Maximum Number of k-Hooks of Partitions of n

preprint2012arXivOpen access

Abstract

Let αk(λ)α_k(λ) denote the number of kk-hooks in a partition λλ and let b(n,k)b(n,k) be the maximum value of αk(λ)α_k(λ) among partitions of nn. Amdeberhan posed a conjecture on the generating function of b(n,1)b(n,1). We give a proof of this conjecture. In general, we obtain a formula that can be used to determine b(n,k)b(n,k). This leads to a generating function formula for b(n,k)b(n,k). We introduce the notion of nearly kk-triangular partitions. We show that for any nn, there is a nearly kk-triangular partition which can be transformed into a partition of nn that attains the maximum number of kk-hooks. The operations for the transformation enable us to compute the number b(n,k)b(n,k).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.