On the maximum number of k-hooks of partitions of n

From MaRDI portal
(Redirected from Publication:396759)
On the maximum number of \(k\)-hooks of partitions of \(n\)




Abstract: Let alphak(lambda) denote the number of k-hooks in a partition lambda and let b(n,k) be the maximum value of alphak(lambda) among partitions of n. Amdeberhan posed a conjecture on the generating function of 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). This leads to a generating function formula for b(n,k). We introduce the notion of nearly k-triangular partitions. We show that for any n, there is a nearly k-triangular partition which can be transformed into a partition of n that attains the maximum number of k-hooks. The operations for the transformation enable us to compute the number b(n,k).











This page was built for publication: On the maximum number of \(k\)-hooks of partitions of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396759)